Results 11 to 20 of about 3,550,540 (296)
Parameterized Algorithms for Book Embedding Problems [PDF]
Journal 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. We study the problem of determining whether $G$ admits a $k$-page book embedding both when the linear order of the vertices is fixed, called ${\rm F{\small IXED}
Sujoy Bhore +3 more
semanticscholar +10 more sources
Advancements on SEFE and Partitioned Book Embedding problems [PDF]
Theoretical Computer Science, 2015 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
On Dispersable Book Embeddings [PDF]
Theoretical 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 page cross, and (ii) the graphs induced by the edges of each page are 1-regular.
Michael A. Bekos +4 more
semanticscholar +10 more sources
Upward Book Embeddings of st-Graphs
35th 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 along the spine of the book. We show that testing whether a graph admits a $k$UBE is NP-complete for
Binucci C. +5 more
semanticscholar +9 more sources
On Open Book Embedding of Contact Manifolds in the Standard Contact Sphere [PDF]
Canadian 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
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm [PDF]
International 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
, 2008 Given an embedded planar acyclic digraph G, we define the problem of "acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be the problem of determining an hamiltonian path completion set of edges such that, when these edges
Mchedlidze, Tamara, Symvonis, Antonios
core +3 more sources
Book embeddings of Reeb graphs [PDF]
, 2013 Let $X$ be a simplicial complex with a piecewise linear function $f:X\to\mathbb{R}$. The Reeb graph $Reeb(f,X)$ is the quotient of $X$, where we collapse each connected component of $f^{-1}(t)$ to a single point.
Kurlin, Vitaliy
core +2 more sources
IEEE AccessBook 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