Results 1 to 10 of about 199,257 (168)
Book embeddings of Reeb graphs [PDF]
CoRR, 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
Two-Page Book Embeddings of 4-Planar Graphs [PDF]
, 2014 Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three.
Bekos, Michael A. +2 more
core +6 more sources
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings) [PDF]
, 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 +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 +4 more sources
Advancements on SEFE and Partitioned Book Embedding problems
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, Giordano Da Lozzo
exaly +5 more sources
Optimum embedding of complete graphs in books
Discrete Mathematics, 1998 The author gives an embedding of the complete graph with \(n\) vertices in a book of width \(n-3\) and \(\lceil n/2 \rceil\) pages---this improves an older result that needs width \(n\) for the same number of pages. An embedding of a graph in a book is an arrangement of the vertices along the spine and edges on the pages such that no edges residing on ...
exaly +3 more sources
On dispersable book embeddings [PDF]
Theoretical Computer Science, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Jawaherul Alam +5 more
openaire +5 more sources
Word Embedding for Social Book Suggestion
, 2016 International audienceThis paper presents the joint work of the Universities of Grenoble and Saint-´ Etienne at CLEF 2016 Social Book Search Suggestion Track.
Abdulahhad, Karam +3 more
core +3 more sources
Book Review: Embeddings in manifolds [PDF]
Bulletin of the American Mathematical Society, 2011 J. W. Cannon
openalex +3 more sources