Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams

DOI10.1007/978-3-319-08404-6_23zbMath1416.68138OpenAlexW381489330MaRDI QIDQ3188901

Tamara Mchedlidze, Boris Klemz, Martin Nöllenburg

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08404-6_23

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Vertices removal for feasibility of clustered spanning trees ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ Short plane supports for spatial hypergraphs ⋮ Short Plane Supports for Spatial Hypergraphs ⋮ Multi-colored spanning graphs

This page was built for publication: Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams