How to draw a hypergraph

DOI10.1080/00207169008803875zbMath0699.68090OpenAlexW2043086882WikidataQ56171388 ScholiaQ56171388MaRDI QIDQ3477978

Erkki Maekinen

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803875

zbMATH Keywords

hypergraphsproblemVenn diagramhierarchical graphedge standardhierarchical hypergraphone-sided bunchsubset standardZykov planarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Data structures (68P05) Theory of software (68N99)

Related Items (7)

An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Algorithms for the Hypergraph and the Minor Crossing Number Problems ⋮ The Painter’s Problem: Covering a Grid with Colored Connected Polygons ⋮ Blocks of Hypergraphs ⋮ Subdivision Drawings of Hypergraphs

Cites Work

• Drawing plane graphs nicely
• Layouts with wires of balanced length
• Hypermaps versus bipartite maps
• Degrees of acyclicity for hypergraphs and relational database schemes
• Crossing Number is NP-Complete
• On minimal-node-cost planar embeddings
• Hypergraph planarity and the complexity of drawing venn diagrams

This page was built for publication: How to draw a hypergraph