Drawing hypergraphs in the subset standard

DOI10.1007/3-540-44541-2_15MaRDI QIDQ4472303zbMATH OpenFDO

Authors François Bertault, Peter Eades

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1984/19840164.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• How to draw a hypergraph
• An algorithm for drawing general undirected graphs
• A multilevel algorithm for force-directed graph drawing
• scientific article; zbMATH DE number 30296
• A Multilevel Algorithm for Force-Directed Graph-Drawing

Cited in

(4)

• Twins in Subdivision Drawings of Hypergraphs
• How to draw a hypergraph
• Subdivision Drawings of Hypergraphs
• Using the metro-map metaphor for drawing hypergraphs

This page was built for publication: Drawing hypergraphs in the subset standard

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