NP-completeness of st-orientations for plane graphs

DOI10.1016/J.TCS.2009.11.006MaRDI QIDQ2268858zbMATH OpenOpenAlexFDO

Authors Sadish Sadasivam, Huaming Zhang

Publication date 9 March 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.11.006

zbMATH Keywords

\(st\)-orientationNP-completeplane graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• NP-Completeness of st-Orientations for Plane Graphs
• Parameterized st-Orientations of Graphs: Algorithms and Experiments
• The complexity of two graph orientation problems
• Planar oriented graphs of diameter two
• Algorithms for computing a parameterized \(st\)-orientation

Cites work

• A linear-time algorithm for four-partitioning four-connected planar graphs
• A unified approach to visibility representations of planar graphs
• Algorithms for area-efficient orthogonal drawing
• Algorithms for computing a parameterized \(st\)-orientation
• Computing an st-numbering
• Directional Routing via Generalized st-Numberings
• Graph Drawing
• Graph theory
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 3315017 (Why is no real title available?)
• On Finding the Rectangular Duals of Planar Triangular Graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs

Cited in

(9)

• Complexity of the multi-service center problem
• Complexity dichotomy for oriented homomorphism of planar graphs with large girth
• NP-Completeness of st-Orientations for Plane Graphs
• Parameterized st-Orientations of Graphs: Algorithms and Experiments
• The complexity of two graph orientation problems
• Compact visibility representation of 4-connected plane graphs
• Complexity of the multi-service center problem
• On the existence of funneled orientations for classes of rooted phylogenetic networks
• Algorithms for computing a parameterized \(st\)-orientation

This page was built for publication: NP-completeness of st-orientations for plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268858)