Results 261 to 270 of about 12,131,917 (294)

Optimum embedding of complete graphs in books

open access: yesDiscrete Mathematics, 1998
The author gives an embedding of the complete graph with \(n\) vertices in a book of width \(n-3\) and \(\lceil n/2 \rceil\) pages---this improves an older result that needs width \(n\) for the same number of pages. An embedding of a graph in a book is an arrangement of the vertices along the spine and edges on the pages such that no edges residing on ...
exaly   +4 more sources
Some of the next articles are maybe not open access.

Related searches:

Embedding the mesh in books

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

Book embeddings and crossing numbers

1995
The 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

Book embedding of complex network with community structure

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jixiang Meng, Wengu Chen, Fengxia Liu
exaly   +4 more sources

Degree constrained book embeddings

Journal of Algorithms, 2002
Summary: 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   +3 more sources

A Designer Embedded Book Space Experiment

2021
The 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   +2 more sources

A study of typenumber in book-embedding.

Ars Comb., 2002
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   +2 more sources

Klein book embeddings

Afrika Matematika
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luke Martin   +3 more
openaire   +2 more sources

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   +2 more sources

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

Home - About - Disclaimer - Privacy