Results 1 to 10 of about 3,366,127 (326)

Advancements on SEFE and Partitioned Book Embedding Problems [PDF]

open access: greenTheoretical Computer Science, 2013
29 pages, 10 figures, extended version of 'On Some NP-complete SEFE Problems' (Eighth International Workshop on Algorithms and Computation, 2014)
Patrizio Angelini   +2 more
semanticscholar   +7 more sources

Parameterized Algorithms for Book Embedding Problems [PDF]

open access: greenJournal of Graph Algorithms and Applications, 2019
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross.
Sujoy Bhore   +3 more
semanticscholar   +9 more sources

On Dispersable Book Embeddings [PDF]

open access: greenTheoretical Computer Science, 2018
In a dispersable book embedding, the vertices of a given graph $G$ must be ordered along a line l, called spine, and the edges of G must be drawn at different half-planes bounded by l, called pages of the book, such that: (i) no two edges of the same ...
Jawaherul Md. Alam   +4 more
semanticscholar   +10 more sources

Upward Book Embeddings of st-Graphs

open access: green35th International Symposium on Computational Geometry (SoCG 2019), 2019
We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a topological ordering ...
Carla Binucci   +5 more
semanticscholar   +9 more sources

On Open Book Embedding of Contact Manifolds in the Standard Contact Sphere [PDF]

open access: greenCanadian mathematical bulletin, 2019
We prove some open book embedding results in the contact category with a constructive approach. As a consequence, we give an alternative proof of a theorem of Etnyre and Lekili that produces a large class of contact 3-manifolds admitting contact open ...
Kuldeep Saha
openalex   +3 more sources

Matching book thickness of generalized Petersen graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2022
The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
doaj   +2 more sources

Oriented Book Embeddings

open access: green, 2016
9 pages, 5 ...
Stacey McAdams, Jinko Kanno
openalex   +4 more sources

Implementing a Partitioned 2-Page Book Embedding Testing Algorithm [PDF]

open access: bronzeInternational Symposium Graph Drawing and Network Visualization, 2013
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 on the same page do not cross.
Patrizio Angelini   +2 more
openalex   +3 more sources

Enhancing Library Digitalization: A Heterogeneous Network Embedding Approach for Personalized Book Recommendations

open access: goldIEEE Access
Book recommendations are crucial in digital library transformation, enhancing service sophistication and customization. They allow readers to access books tailored to their specific interests.
Yafeng Kong
doaj   +2 more sources

Improved book-embeddings of incomplete hypercubes

open access: hybridDiscrete Applied Mathematics, 2008
AbstractIn this paper, we show that any incomplete hypercube with, at most, 2n+2n−1+2n−2 vertices can be embedded in n−1 pages for all n≥4. For the case n≥4, this result improves Fang and Lai’s result that any incomplete hypercube with, at most, 2n+2n−1 vertices can be embedded in n−1 pages for all n≥2.Besides this, we show that the result can be ...
Toru Hasunuma
openalex   +2 more sources

Home - About - Disclaimer - Privacy