Results 241 to 250 of about 199,356 (267)

Klein book embeddings

Afrika Matematika
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luke Martin, Thomas McKenzie, Shannon Overbay, Lin Ai Tan   +3 more
openaire   +2 more sources

A study of typenumber in book-embedding.

Ars Comb., 2003
A 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

Topological Book Embedding of Bipartite Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
A topological book embedding of a graph is an embedding in a book that carries the vertices in the spine of the book and the edges in the pages so that edges are allowed to cross the spine. Recently, the author has shown that for an arbitrary graph G with n vertices there exists a d+1-page book embedding of G in which each edge crosses the spine logdn ...
openaire   +1 more source

Book review: Designing Embedded Hardware

ACM SIGPLAN Notices, 2006
My last column finished up a two-part retrospective to recap the first ten years of ACM Sigplan Notices Forth Report . If you have access to back issues of Sigplan or ACM Portal , you must have enjoyed the review that much more. I hope so.
openaire   +1 more source

Embedding graphs in books: a survey

IEE Proceedings E Computers and Digital Techniques, 1992
Embedding a graph in a book is an arrangement of vertices in a line along the spine of the book and edges on the pages in such a way that edges residing on the same page do not cross. Each graph has many different embeddings in books. The embedding with the minimum number of pages is optimum.
openaire   +1 more source

Embedding in The Little Red Book

exaly   +2 more sources

Efficient deterministic algorithms for embedding graphs on books

1996
We derive deterministic polynomial time algorithms for book embedding of a graph G = (V, E), ¦V¦ = n and ¦E¦ = m. In particular, we present the first deterministic polynomial time algorithm to embed any bipartite graph in \(O(\sqrt m )\)pages. We then use this algorithm to embed, in polynomial time, any graph G in \(O(\sqrt {\delta ^ * (G) \cdot m ...
Farhad Shahrokhi, Weiping Shi
openaire   +1 more source

The book embedding of ordered sets

2013
A large number of important problems in different areas can be expressed as graph layout problems whose objective is to determine a linear layout in such way that a certain objective cost is optimized. In a book embedding for an ordered set, the elements are embedded on the spine of the book to form a linear extension.
openaire   +2 more sources

A survey on book-embedding of planar graphs

Frontiers of Mathematics in China, 2022
Weihua Yang, Jixiang Meng
exaly  

Embedding planar 5-graphs in three pages

Discrete Applied Mathematics, 2020
Weihua Yang
exaly