Results 1 to 10 of about 184,768 (320)
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.
Jawaherul Md. Alam +4 more
+9 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
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
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
openalex +7 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
Carla Binucci +5 more
openalex +8 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
Advancements on SEFE and Partitioned Book Embedding Problems
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
openalex +6 more sources
Improved book-embeddings of incomplete hypercubes
Discrete 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