NP-Completeness of st-Orientations for Plane Graphs

DOI10.1007/978-3-642-03409-1_27zbMath1252.68213OpenAlexW1796046148MaRDI QIDQ3183620

Sadish Sadasivam, Huaming Zhang

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03409-1_27

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs

This page was built for publication: NP-Completeness of st-Orientations for Plane Graphs