Results 1 to 10 of about 3,644,444 (342)
Parameterized Algorithms for Book Embedding Problems [PDF]
Journal of Graph Algorithms and Applications, 2020 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 +6 more sources
On dispersable book embeddings [PDF]
Theoretical Computer Science, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jawaherul Md. Alam +5 more
semanticscholar +9 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 +4 more sources
Semantic Dependency Parsing via Book Embedding [PDF]
Proceedings of the 55th Annual Meeting of the Association for
Computational Linguistics (Volume 1: Long Papers), 2017 Modelamos un gráfico de dependencia como un libro, un tipo particular de espacio topológico, para el análisis de dependencia semántica. La columna vertebral del libro se compone de una secuencia de palabras, y cada página contiene un subconjunto de arcos no cruzados. Para construir un gráfico semántico para una oración dada, diseñamos nuevos algoritmos
Weiwei Sun, Junjie Cao, Xiaojun Wan
semanticscholar +3 more sources
Upward Book Embeddings of st-Graphs [PDF]
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
+8 more sources
Oriented Book Embeddings [PDF]
, 2016 9 pages, 5 ...
Stacey McAdams, Jinko Kanno
openalex +3 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
Book Embeddings of Graph Products [PDF]
, 2020 A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book thickness, page number) of a graph is the minimum $k$ such that it admits a $k$-stack layout.
Sergey Pupyrev
openalex +3 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
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