Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
DOI10.1007/978-3-642-00202-1_22zbMATH Open1211.05030OpenAlexW1555017787MaRDI QIDQ3605502FDOQ3605502
Antonios Symvonis, Tamara Mchedlidze
Publication date: 24 February 2009
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_22
Recommendations
- Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs
- Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
- Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
- Spine Crossing Minimization in Upward Topological Book Embeddings
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- The Two-Triangle Case of the Acquaintance Graph
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Title not available (Why is that?)
- Counting linear extensions
- Some simplified NP-complete graph problems
- A unified approach to visibility representations of planar graphs
- Generating Linear Extensions Fast
- Embedding planar graphs in four pages
- Tackling the jump number of interval orders
- Optimal Linear Extensions by Interchanging Chains
- Minimizing Setups for Cycle-Free Ordered Sets
- Algorithms for plane representations of acyclic digraphs
- Fundamentals of planar ordered sets
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Posets
- Dynamic maintenance of planar digraphs, with applications
- Title not available (Why is that?)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- On minimizing jumps for ordered sets
- Curve-constrained drawings of planar graphs
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
- Minimizing setups in ordered sets of fixed width
- Jump number of dags having Dilworth number 2
- Ordered sets, pagenumbers and planarity
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs
- Fundamentals of Computation Theory
Cited In (7)
- Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
- Evolutionary operators for the Hamiltonian completion problem
- Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
- Recognizing DAGs with page-number 2 is NP-complete
- On the upward book thickness problem: combinatorial and complexity results
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Spine Crossing Minimization in Upward Topological Book Embeddings
This page was built for publication: Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605502)
