Skip to main content
Journal ArticleOPEN ACCESS

An Experimental Study of Crossing Minimization Heuristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2912 13-24
DOI: 10.1007/978-3-540-24595-7_2
33Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present an extensive experimental study of heuristics for crossing minimization. The heuristics are based on the planarization approach, so far the most successful framework for crossing minimization. We study the effects of various methods for computing a maximal planar subgraph and for edge re-insertion including post-processing and randomization. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Gutwenger, G., & Mutzel, P. (2004). An Experimental Study of Crossing Minimization Heuristics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 13–24. https://doi.org/10.1007/978-3-540-24595-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free