Hypergraph and minor crossing number problems

DOI10.7155/JGAA.00353MaRDI QIDQ5246712zbMATH OpenOpenAlexFDO

Authors Markus Chimani, Carsten Gutwenger

Publication date 22 April 2015

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00353

zbMATH Keywords

hypergraph minimizationminor crossingplanarization-based heuristics

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph minors (05C83) Applications of graph theory (05C90)

Recommendations

• Algorithms for the Hypergraph and the Minor Crossing Number Problems
• Crossing minimization and layouts of directed hypergraphs with port constraints
• On the Crossing Number of Almost Planar Graphs
• Graph Drawing
• On graph crossing number and edge planarization

Cited in

(5)

• The minor crossing number of graphs with an excluded minor
• Minimization of the half-perimeters of edges in the arrangement of a hypergraph on a lattice
• Crossing minimization and layouts of directed hypergraphs with port constraints
• Graph minors and the crossing number of graphs
• Algorithms for the Hypergraph and the Minor Crossing Number Problems

Describes a project that uses

Uses Software

• OGDF

This page was built for publication: Hypergraph and minor crossing number problems

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