Orthogonal Hypergraph Drawing for Improved Visibility

DOI10.7155/JGAA.00122MaRDI QIDQ5301385zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Thomas Eschbach, Wolfgang Günther, Bernd Becker

Publication date 19 January 2009

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

Full work available at URL https://eudml.org/doc/55412, http://www.emis.de/journals/JGAA/accepted/2006/EschbachGuentherBecker2006.10.2.pdf, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.6133

zbMATH Keywords

electronic design automationvisualization of circuits

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1194183
• A better heuristic for orthogonal graph drawings
• Techniques for the Refinement of Orthogonal Graph Drawings
• Interactive orthogonal graph drawing
• Efficient orthogonal drawings of high degree graphs
• scientific article; zbMATH DE number 1693471
• Ortho-radial drawing of graphs
• Orthogonal graph drawing with flexibility constraints
• Orthogonal graph drawing with flexibility constraints
• scientific article; zbMATH DE number 1974102

Cited in

(9)

• Subdivision of hypergraphs and their colorings
• Using the metro-map metaphor for drawing hypergraphs
• Algorithms for the Hypergraph and the Minor Crossing Number Problems
• The role of twins in computing planar supports of hypergraphs
• Twins in Subdivision Drawings of Hypergraphs
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Orthogonal drawings of graphs for the automation of VLSI circuit design
• Subdivision Drawings of Hypergraphs
• Interactive orthogonal graph drawing

This page was built for publication: Orthogonal Hypergraph Drawing for Improved Visibility

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