Path-based supports for hypergraphs

DOI10.1007/978-3-642-19222-7_3MaRDI QIDQ3000490zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

• An improved algorithm for the metro-line crossing minimization problem
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Hypergraph planarity and the complexity of drawing venn diagrams
• Mixed hypercacti
• On planar supports for hypergraphs
• 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
• Subdivision Drawings of Hypergraphs
• The clustering matroid and the optimal clustering tree

Cited in

(8)

• Short plane supports for spatial hypergraphs
• Path-based supports for hypergraphs
• On planar supports for hypergraphs
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Hypergraph edge representations with the use of homological paths
• On planar supports for hypergraphs
• Short plane supports for spatial hypergraphs
• Minimum tree supports for hypergraphs and low-concurrency Euler diagrams

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)