LIPIcs.IPEC.2024.35.pdf
- Filesize: 0.6 MB
- 5 pages
Document
PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization
Authors
Ragnar Groot Koerkamp 
,
Mees de Vries
-
Part of:
Volume:
19th International Symposium on Parameterized and Exact Computation (IPEC 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-12-05
File
Document Identifiers
Author Details
Cite As Get BibTex
Ragnar Groot Koerkamp and Mees de Vries. PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 35:1-35:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.IPEC.2024.35
Abstract
Given a bipartite graph (A,B), the one-sided crossing minimization (OCM) problem is to find an ordering of the vertices of B that minimizes the number of edge crossings when drawn in the plane. We introduce the novel strongly fixed, practically fixed, and practically glued reductions that maximally generalize some existing reductions. We apply these in our exact solver OCMu64, that directly uses branch-and-bound on the ordering of the vertices of B and does not depend on ILP or SAT solvers.
Subject Classification
ACM Subject Classification
- Theory of computation → Mathematical optimization
- Theory of computation → Computational geometry
Keywords
- Graph drawing
- crossing number
- branch and bound
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Vida Dujmovic, Henning Fernau, and Michael Kaufmann. Fixed parameter algorithms for one-sided crossing minimization revisited. Journal of Discrete Algorithms, 6(2):313-323, June 2008. URL: https://doi.org/10.1016/j.jda.2006.12.008.
- Vida Dujmovic and Sue Whitesides. An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica, 40(1):15-31, April 2004. URL: https://doi.org/10.1007/s00453-004-1093-2.
-
P. Eades and N.C. Wormald. The Median Heuristic for Drawing 2-layered Networks. Technical report. University of Queensland, Department of Computer Science, 1986.
-
Peter Eades and David Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 21(A):89-98, 1986.
- Peter Eades and Nicholas C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4):379-403, April 1994. URL: https://doi.org/10.1007/bf01187020.
- Ragnar Groot Koerkamp and Mees de Vries. OCMu64. Software (visited on 2024-11-28). URL: https://github.com/mjdv/ocmu64, URL: https://doi.org/10.4230/artifacts.22525.
- Ragnar Groot Koerkamp and Mees de Vries. OCMu64. Software (visited on 2024-11-28). URL: https://doi.org/10.5281/zenodo.11671980.
- Erkki Mäkinen. Experiments on drawing 2-level hierarchical graphs. International Journal of Computer Mathematics, 36(3-4):175-181, January 1990. URL: https://doi.org/10.1080/00207169008803921.