Algorithms for the Hypergraph and the Minor Crossing Number Problems

DOI10.1007/978-3-540-77120-3_18MaRDI QIDQ5387756zbMATH OpenOpenAlexFDO

Authors Markus Chimani, Carsten Gutwenger

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

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

Recommendations

• Hypergraph and minor crossing number problems
• A New Approach to Exact Crossing Minimization
• Graph Drawing
• On the Crossing Number of Almost Planar Graphs
• An algorithm for the graph crossing number problem

Cites work

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

Cited in

(6)

• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Algorithms for graphs embeddable with few crossings per edge
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• A New Approach to Exact Crossing Minimization
• Hypergraph and minor crossing number problems
• Fundamentals of Computation Theory

Describes a project that uses

Uses Software

• Algorithm 447

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

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