An Approach for Mixed Upward Planarization

DOI10.7155/JGAA.00067MaRDI QIDQ4435351zbMATH OpenOpenAlexFDO

Authors Markus Eiglsperger, Frank Eppinger, Michael Kaufmann

Publication date 30 November 2003

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00067

zbMATH Keywords

graph drawingSugiyama algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 1830748
• Graph Drawing
• Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods
• On the upward planarity of mixed plane graphs
• Upward planarity testing of embedded mixed graphs

Cited in

(12)

• scientific article; zbMATH DE number 1830748 (Why is no real title available?)
• \(st\)-orientations with few transitive edges
• $st$-Orientations with Few Transitive Edges
• Graph Drawing
• Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods
• Maximum upward planar subgraphs of embedded planar digraphs
• On the upward planarity of mixed plane graphs
• Upward and quasi-upward planarity testing of embedded mixed graphs
• On the upward planarity of mixed plane graphs
• Upward planarization layout
• Upward planarization layout
• Upward planarity testing of embedded mixed graphs

This page was built for publication: An Approach for Mixed Upward Planarization

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