Results 1 to 10 of about 3,592,441 (346)
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.
Sujoy Bhore +3 more
semanticscholar +9 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 ...
Jawaherul Md. Alam +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 ...
Carla Binucci +5 more
semanticscholar +9 more sources
Advancements on SEFE and Partitioned Book Embedding Problems [PDF]
Theoretical 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
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
Matching book thickness of generalized Petersen graphs
Electronic 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
On the optimal layout of (K p − C p ) n into grid and certain structures [PDF]
Scientific ReportsInterconnection networks constitute complex configurations of processors and communication links that facilitate data transmission between processors in a parallel computing system.
G. Caroline Vincy, David Raj Micheal
doaj +2 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
Tamara Mchedlidze, Antonios Symvonis
openalex +4 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
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