On 1-bend upward point-set embeddings of \(st\)-digraphs
From MaRDI portal
Publication:6547912
DOI10.1007/978-3-031-55598-5_1MaRDI QIDQ6547912
Fabrizio Montecchiani, Emilio Di Giacomo, Anaïs Villedieu, Henry Förster, Daria Kokhovich, Antonios Symvonis, Tamara Mchedlidze
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- On point-sets that support planar graphs
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Point-set embeddings of trees with given partial drawings
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Upward straight-line embeddings of directed graphs into point sets
- The book thickness of a graph
- On embedding an outer-planar graph in a point set
- On upward point set embeddability
- On the curve complexity of 3-colored point-set embeddings
- Upward point set embeddings of paths and trees
- Computing upward topological book embeddings of upward planar digraphs
- Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
- Book embeddability of series-parallel digraphs
- Recognizing DAGs with page-number 2 is NP-complete
- Linear-Size Universal Point Sets for One-Bend Drawings
- Upward Geometric Graph Embeddings into Point Sets
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Optimal Algorithms to Embed Trees in a Point Set
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- On the upward book thickness problem: combinatorial and complexity results
- Embedding planar graphs at fixed vertex locations
This page was built for publication: On 1-bend upward point-set embeddings of \(st\)-digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547912)
