Algorithms for the Hypergraph and the Minor Crossing Number Problems

DOI10.1007/978-3-540-77120-3_18zbMath1193.05151OpenAlexW1820690307MaRDI QIDQ5387756

Carsten Gutwenger, Markus Chimani

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A New Approach to Exact Crossing Minimization ⋮ Blocks of Hypergraphs

Uses Software

• Algorithm 447

Cites Work

• Inserting an edge into a planar graph
• An experimental comparison of four graph drawing algorithms.
• Crossing number is hard for cubic graphs
• Graph minors and the crossing number of graphs
• The Minor Crossing Number
• How to draw a hypergraph
• Hypergraph planarity and the complexity of drawing venn diagrams
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Graph Drawing
• Orthogonal Hypergraph Drawing for Improved Visibility

This page was built for publication: Algorithms for the Hypergraph and the Minor Crossing Number Problems