Bimodal crossing minimization

Authors:
Christoph Buchheim;Michael Jünger;Annette Menze;Merijam Percan
Affiliations:
Institut für Informatik, Universität zu Köln, Köln, Germany;Institut für Informatik, Universität zu Köln, Köln, Germany;Institut für Informatik, Universität zu Köln, Köln, Germany;Institut für Informatik, Universität zu Köln, Köln, Germany
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 4
Cited 2

Alpha-algorithms for incremental planarity testing (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Splitting number is NP-complete

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
A Linear Algorithm for the Maximal Planar Subgraph Problem

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Exact crossing minimization

GD'05 Proceedings of the 13th international conference on Graph Drawing

A New Approach to Exact Crossing Minimization

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Facets in the Crossing Number Polytope

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of drawing a directed graph in two dimensions with a minimum number of crossings such that for every node the incoming edges appear consecutively in the cyclic adjacency lists. We show how to adapt the planarization method and the recently devised exact crossing minimization approach in a simple way. We report experimental results on the increase in the number of crossings involved by this additional restriction on the set of feasible drawings. It turns out that this increase is negligible for most practical instances.