Results 261 to 270 of about 7,209 (302)
Some of the next articles are maybe not open access.
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
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
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
Lefschetz Open Book Embeddings of 4-Manifolds
Studia Scientiarum Mathematicarum Hungarica, 2022In this article, we define the notion of a generalized open book of a n-manifold over the k−sphere Sk , k < n. We discuss Lefschetz open book embeddings of Lefschetz open books of closed oriented 4-manifolds into the trivial open book over S2 of the 7−sphere S7 .
Abhijeet Ghanwat +2 more
openaire +1 more source
Embedding the incomplete hypercube in books
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fang, Jywe-Fei, Lai, Kuan-Chou
openaire +2 more sources
Book review: Designing Embedded Hardware
ACM SIGPLAN Notices, 2006My 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 generalized Petersen graph in books
Chinese Annals of Mathematics, Series B, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Bin +3 more
openaire +2 more sources
Book Embedding of Toroidal Bipartite Graphs
SIAM Journal on Discrete Mathematics, 2012Endo proved that every toroidal graph has a book embedding with at most seven pages. In this paper, we prove that every toroidal bipartite graph has a book embedding with at most five pages. In order to do so, we prove that every bipartite torus quadrangulation Q with n vertices admits two disjoint noncontractible simple closed curves cutting the torus
Atsuhiro Nakamoto +2 more
openaire +1 more source
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
One-Page Book Embedding under Vertex-Neighborhood Constraints
SIAM Journal on Discrete Mathematics, 1990Summary: The VLSI-related problem of embedding graphs in books is studied. A book embedding of a graph \(G=(V,E)\) consists of two parts, namely, (1) an ordering of \(V\) along the spine of the book, and (2) an assignment of each \(e\in E\) to a page of the book, so that edges assigned to the same page do not intersect.
Moran, Shlomo, Wolfstahl, Yaron
openaire +2 more sources