Results 251 to 260 of about 11,283 (285)
Some of the next articles are maybe not open access.
Book Embeddings of Regular Graphs
SIAM Journal on Discrete Mathematics, 2015Summary: In the influential papers in which \textit{M. Malitz} [J. Algorithms 17, No. 1, 71--84 (1994; Zbl 0810.68102); ibid. No. 1, 85--109 (1994; Zbl 0810.68103)] proved that every graph with \(m\) edges can be embedded in a book with \(O({m}^{1/2})\) pages, he proved the existence of \(d\)-regular \(n\)-vertex graphs that require \(\Omega(\sqrt{d}n^{
József Balogh, Gelasio Salazar
openaire +2 more sources
Embedding the incomplete hypercube in books
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jywe-Fei Fang, Kuan-Chou Lai
openaire +2 more sources
Vertex Types in Book-Embeddings
SIAM Journal on Discrete Mathematics, 1989A new measure of the complexity of a book-embedding of a simple undirected graph, the number of vertex types in the embedding, is studied. The type of a vertex $v $ in a p-page book-embedding is the $p \times 2$ matrix of nonnegative integers \[ \tau (v ) = \begin{pmatrix} L_1 & & R_1 \\ L_2 & & R_2 \\ & \vdots & \\ L_P & & {R_P } \end{pmatrix ...
Jonathan F. Buss +2 more
openaire +1 more source
Upward Topological Book Embeddings of DAGs [PDF]
SIAM Journal on Discrete Mathematics, 2011 Let G be a directed acyclic graph (DAG). An upward (k,h)-topological book embedding of G is an upward book embedding on k pages of a subdivision of G where every edge is replaced by a path having at most h+2 vertices. In this paper it is proved that every DAG with n vertices admits an upward (d+1, 2⌈logdn⌉-1)-topological book embedding, where d is any ...
DI GIACOMO, Emilio +2 more
openaire +1 more source
PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005., 2005
In this paper, we study the linear layout problem of the rectangular mesh by the embedding-in-book technique. Embedding a graph in a book is to place nodes on the spine of a book and to draw the edges such that edges residing in a page do not cross. We propose a scheme to embed an h /spl times/ w rectangular mesh with two pages and book width Min(h,w ...
null Erh-Ying Yen +4 more
openaire +1 more source
In this paper, we study the linear layout problem of the rectangular mesh by the embedding-in-book technique. Embedding a graph in a book is to place nodes on the spine of a book and to draw the edges such that edges residing in a page do not cross. We propose a scheme to embed an h /spl times/ w rectangular mesh with two pages and book width Min(h,w ...
null Erh-Ying Yen +4 more
openaire +1 more source
Book embeddings and crossing numbers
1995The paper introduces the book crossing number problem which can be viewed as a variant of the well-known plane and surface crossing number problem or as a generalization of the book embedding problem. The book crossing number of a graph G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book ...
Farhad Shahrokhi +3 more
openaire +1 more source
Degree constrained book embeddings
Journal of Algorithms, 2002Summary: A book embedding of a graph consists of a linear ordering of the vertices along a line in 3-space (the spine) and an assignment of edges to half-planes with the spine as boundary (the pages) so that edges assigned to the same page can be drawn on that page without crossings.
openaire +2 more sources
A Designer Embedded Book Space Experiment
2021The relationship between books and their readers are intimacy and personal. The texts are firsthand resources for readers experience personal journey while reading, and their own unparalleled inspiration. The reflection after reading could be represented in diverse fashions, most of them were written using words as reviews.
Tao-Tao Yu, Teng-Wen Chang
openaire +1 more source
Afrika Matematika
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luke Martin +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luke Martin +3 more
openaire +2 more sources
A study of typenumber in book-embedding.
Ars Comb., 2002A book is a set of half-planes (the pages of the book) that share a common boundary line (the spine of the book). An embedding of a simple undirected graph \(G\) into a book consists of an ordering of the vertices of \(G\) along the spine of the book, together with an assignment of each edge of \(G\) to a page of the book, in which edges assigned to ...
Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun
openaire +1 more source