Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs

DOI10.1007/978-3-642-10631-6_89zbMath1211.05031OpenAlexW2163569217MaRDI QIDQ3652275

Tamara Mchedlidze, Antonios Symvonis

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_89

zbMATH Keywords

book embeddingsupward planar digraphscrossing free acyclic Hamiltonian path completion

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Evolutionary operators for the Hamiltonian completion problem ⋮ A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Upward Book Embeddings of st-Graphs

This page was built for publication: Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs