Graph Drawing

DOI10.1007/11618058MaRDI QIDQ5897658zbMATH OpenOpenAlexFDO

Authors Martin Siebenhaller, Michael Kaufmann

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

Recommendations

• scientific article; zbMATH DE number 1830748
• An Approach for Mixed Upward Planarization
• An Improved Upward Planarity Testing Algorithm and Related Applications
• Upward Planarity Testing: A Computational Study
• Algorithms – ESA 2004
• TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
• SOFSEM 2005: Theory and Practice of Computer Science
• A near-optimal planarization algorithm
• On the upward planarity of mixed plane graphs
• On the upward planarity of mixed plane graphs

Cited in

(3)

• scientific article; zbMATH DE number 1830748 (Why is no real title available?)
• Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods
• An Approach for Mixed Upward Planarization

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 Q5897658)