Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs

DOI10.1007/978-3-642-02882-3_9zbMath1248.05204OpenAlexW2169948044MaRDI QIDQ5323052

Antonios Symvonis, Tamara Mchedlidze

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_9

zbMATH Keywords

polygon decompositioncrossing minimizationHamiltonian path problembook embeddingsembedded planar acyclic digraphacyclic Hamiltonian path completionHamiltonian acyclic digraphspine crossings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Fundamentals of planar ordered sets
• Algorithms for plane representations of acyclic digraphs
• Some simplified NP-complete graph problems
• Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
• Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings

This page was built for publication: Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs