Graph Drawing

DOI10.1007/11618058MaRDI QIDQ5897644zbMATH OpenOpenAlexFDO

Authors Charalampos Papamanthou, Ioannis G. Tollis

Publication date 13 November 2006

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

Full work available at URL https://doi.org/10.1007/11618058

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) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Applications of parameterized \(st\)-orientations
• Parameterized st-Orientations of Graphs: Algorithms and Experiments
• Algorithms for computing a parameterized \(st\)-orientation
• Bitonic \(st\)-orderings of biconnected planar graphs
• scientific article; zbMATH DE number 1947397

Cited in

(9)

• $st$-Orientations with Few Transitive Edges
• Compact visibility representation of 4-connected plane graphs
• Applications of parameterized \(st\)-orientations
• On Representation of Planar Graphs by Segments
• Algorithms for computing a parameterized \(st\)-orientation
• Optimal st-orientations for plane triangulations
• NP-completeness of st-orientations for plane graphs
• On the existence of funneled orientations for classes of rooted phylogenetic networks
• Parameterized st-Orientations of Graphs: Algorithms and Experiments

This page was built for publication: Graph Drawing

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