Subdivision Drawings of Hypergraphs

DOI10.1007/978-3-642-00219-9_39zbMath1213.68462OpenAlexW1689236855WikidataQ56171392 ScholiaQ56171392MaRDI QIDQ3611876

Michael Kaufmann, Bettina Speckmann, Marc J. van Kreveld

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_39

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On intersecting straight line systems, Twins in Subdivision Drawings of Hypergraphs, Colored spanning graphs for set visualization, Path-based supports for hypergraphs, Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem, The Painter’s Problem: Covering a Grid with Colored Connected Polygons, Path-Based Supports for Hypergraphs, Blocks of Hypergraphs, On transversal numbers of intersecting straight line systems and intersecting segment systems, On transversal and 2-packing numbers in uniform linear systems, Trinque problem: covering complete graphs by plane degree-bounded hypergraphs, C-planarity testing of embedded clustered graphs with bounded dual carving-width, CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR, Multi-colored spanning graphs

Cites Work

• Spherical Venn diagrams with involutory isometries
• Realizability of Delaunay triangulations
• Hypermaps versus bipartite maps
• Degrees of acyclicity for hypergraphs and relational database schemes
• How to draw a hypergraph
• Hypergraph planarity and the complexity of drawing venn diagrams
• Orthogonal Hypergraph Drawing for Improved Visibility
• Overlapping Cluster Planarity
• Diagrammatic Representation and Inference
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item