The role of twins in computing planar supports of hypergraphs

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Path-based supports for hypergraphs
On triangulating \(k\)-outerplanar graphs
Call routing and the ratcatcher
The clustering matroid and the optimal clustering tree
Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors.
Colored spanning graphs for set visualization
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Twins in Subdivision Drawings of Hypergraphs
Blocks of Hypergraphs
On the Desirability of Acyclic Database Schemes
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
How to draw a hypergraph
Subdivision Drawings of Hypergraphs
Kernelization: New Upper and Lower Bound Techniques
Hypergraph planarity and the complexity of drawing venn diagrams
On the Consecutive-Retrieval Problem
Realization of hypergraphs by trees of minimal diameter
Optimal branch-decomposition of planar graphs in O ( n ³ ) Time
Atomic Embeddability, Clustered Planarity, and Thickenability
PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
Orthogonal Hypergraph Drawing for Improved Visibility
Overlapping Cluster Planarity
Planarity of Overlapping Clusterings Including Unions of Two Partitions
Diagrammatic Representation and Inference
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.
On Planar Supports for Hypergraphs
Planarity for clustered graphs

This page was built for publication: The role of twins in computing planar supports of hypergraphs

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