Parameterized st-Orientations of Graphs: Algorithms and Experiments

DOI10.1007/978-3-540-70904-6_22MaRDI QIDQ3595466zbMATH OpenOpenAlexFDO

Authors Charalampos Papamanthou, Ioannis G. Tollis

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_22

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms for computing a parameterized \(st\)-orientation
• Applications of parameterized \(st\)-orientations
• Graph Drawing
• NP-Completeness of st-Orientations for Plane Graphs
• NP-completeness of st-orientations for plane graphs

Cited in

(8)

• The complexity of two graph orientation problems
• $st$-Orientations with Few Transitive Edges
• Graph Drawing
• Compact visibility representation of 4-connected plane graphs
• Applications of parameterized \(st\)-orientations
• Algorithms for computing a parameterized \(st\)-orientation
• NP-completeness of st-orientations for plane graphs
• NP-Completeness of st-Orientations for Plane Graphs

This page was built for publication: Parameterized st-Orientations of Graphs: Algorithms and Experiments

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