Path-based supports for hypergraphs

DOI10.1007/978-3-642-19222-7_3zbMATH Open1295.05166OpenAlexW2178495230MaRDI QIDQ3000490FDOQ3000490

Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry

Publication date: 19 May 2011

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

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-179948

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65)

Cites Work

• The clustering matroid and the optimal clustering tree
• An Improved Algorithm for the Metro-line Crossing Minimization Problem
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Mixed hypercacti
• Blocks of Hypergraphs
• Subdivision Drawings of Hypergraphs
• Hypergraph planarity and the complexity of drawing venn diagrams
• On Planar Supports for Hypergraphs

Cited In (2)

• Path-based supports for hypergraphs
• Hypergraph edge representations with the use of homological paths

   Recommendations

• Path-based supports for hypergraphs 👍 👎
• On planar supports for hypergraphs 👍 👎
• On planar supports for hypergraphs 👍 👎
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity 👍 👎
• Short Plane Supports for Spatial Hypergraphs 👍 👎

This page was built for publication: Path-based supports for hypergraphs

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