Results 31 to 40 of about 11,283 (285)
Monotone Arc Diagrams with few Biarcs
Journal of Graph Algorithms and ApplicationsWe show that every planar graph has a monotone topological 2-page book embedding, also known as a monotone arc diagram, where at most $(4n-10)/5$ (of potentially $3n-6$) edges cross the spine, and every edge crosses the spine at most once; such an edge ...
Steven Chaplick +3 more
doaj +1 more source
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs [PDF]
, 2002 An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n3) time and assumes that the input series-parallel digraph does not have transitive edges.
DI GIACOMO, Emilio +3 more
openaire +3 more sources
Journal of Graph Algorithms and ApplicationsGiven a graph $G$ with a fixed vertex order $\prec$, one obtains a circle graph $H$ whose vertices are the edges of $G$ and where two such edges are adjacent if and only if their endpoints are pairwise distinct and alternate in $\prec$.
Patricia Bachmann +2 more
doaj +1 more source
On the Genus of the Idempotent Graph of a Finite Commutative Ring
Discussiones Mathematicae - General Algebra and Applications, 2021 Let R be a finite commutative ring with identity. The idempotent graph of R is the simple undirected graph I(R) with vertex set, the set of all nontrivial idempotents of R and two distinct vertices x and y are adjacent if and only if xy = 0.
Belsi G. Gold, Kavitha S., Selvakumar K.
doaj +1 more source
On exteriority notions in book embeddings and treewidth
Discrete Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baudru, Nicolas, Fratani, Severine
openaire +3 more sources
The matching book embedding under some graph operations
Electronic Journal of Graph Theory and ApplicationsThe matching book embedding of a graph G is an embedding of G with the vertices on the spine, and each edge within a single page so that the edges on each page do not intersect and the degree of vertices on each page is at most one.
Zeling Shao, Min Yao, Zhiguo Li
doaj +1 more source
The Book Embedding Problem from a SAT-Solving Perspective [PDF]
, 2015 In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges of the same page do not cross.
Zielke, Christian +5 more
core +1 more source
Ri-vista: Ricerche per la Progettazione del Paesaggio, 2015 The book - catalog Paesaggi agrari. L'irrinunciabile eredità scientifica di Emilio Sereni edith by Massimo Quaini in collaboration with Gabriella Bonini, Claudio Cerreti, Luisa Rossi and Chiara Visentin - acknowledges and deepens into ten chapters the ...
Gabriella Bonini
doaj +1 more source
What Do Large Language Models Know About Materials?
Advanced Engineering Materials, EarlyView.If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
Slavica Revalensia, 2019 The article discusses the possibility of classifying poetic books on the basis of their vocabulary. The distance between 190 poem collections is calculated as the Euclidean distance between books’ vocabularies, for each element of which the value of TF ...
Boris Orekhov
doaj +1 more source