The DFS-heuristic for orthogonal graph drawing

DOI10.1016/S0925-7721(01)00006-2zbMath0976.68119MaRDI QIDQ5943316

Therese C. Biedl

Publication date: 27 September 2001

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

orthogonal graph drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Area-efficient static and incremental graph drawings
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for area-efficient orthogonal drawing
• A better heuristic for orthogonal graph drawings
• Drawing planar graphs using the canonical ordering
• Efficient orthogonal drawings of high degree graphs
• On pairwise compatibility graphs having Dilworth number two
• THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING
• On minimal-node-cost planar embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Optimal orthogonal drawings of triconnected plane graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The DFS-heuristic for orthogonal graph drawing