Orthogonal Hypergraph Drawing for Improved Visibility
From MaRDI portal
Publication:5301385
DOI10.7155/JGAA.00122zbMATH Open1161.68665DBLPjournals/jgaa/EschbachGB06OpenAlexW2108336404WikidataQ56171387 ScholiaQ56171387MaRDI QIDQ5301385FDOQ5301385
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
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
- Subdivision Drawings of Hypergraphs
- Interactive orthogonal graph drawing
- Twins in Subdivision Drawings of Hypergraphs
- The role of twins in computing planar supports of hypergraphs
- Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
- Algorithms for the Hypergraph and the Minor Crossing Number Problems
- Orthogonal drawings of graphs for the automation of VLSI circuit design
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)
