Algorithms for the hypergraph and the minor crossing number problems

Authors:
Markus Chimani;Carsten Gutwenger
Affiliations:
Department of Computer Science, University of Dortmund, Germany;Department of Computer Science, University of Dortmund, Germany
Venue:
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Year:
2007

Citing 4
Cited 7

A programming project: trimming the spring algorithm for drawing hypergraphs

ACM SIGCSE Bulletin
An experimental comparison of four graph drawing algorithms

Computational Geometry: Theory and Applications
The Minor Crossing Number

SIAM Journal on Discrete Mathematics
Crossing number is hard for cubic graphs

Journal of Combinatorial Theory Series B

A New Approach to Exact Crossing Minimization

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Inserting a vertex into a planar graph

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Taming graphical modeling

MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part I
Crossing minimization and layouts of directed hypergraphs with port constraints

GD'10 Proceedings of the 18th international conference on Graph drawing
Blocks of hypergraphs: applied to hypergraphs and outerplanarity

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Facets in the Crossing Number Polytope

SIAM Journal on Discrete Mathematics
An MDE-based synthesis of aircraft safety models

MEDI'12 Proceedings of the 2nd international conference on Model and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We present some complexity results regarding the corresponding edge and node insertion problems. Based on these results, we give the first embedding-based heuristics to tackle both problems and present a short experimental study. Furthermore, we give the first exact ILP formulation for both problems.