English

weberknecht -- a One-Sided Crossing Minimization solver

Data Structures and Algorithms 2024-12-10 v1

Abstract

We describe the implementation of the exact solver weberknecht and the heuristic solver weberknecht_h for the One-Sided Crossing Minimization problem.

Cite

@article{arxiv.2412.06361,
  title  = {weberknecht -- a One-Sided Crossing Minimization solver},
  author = {Johannes Rauch},
  journal= {arXiv preprint arXiv:2412.06361},
  year   = {2024}
}
R2 v1 2026-06-28T20:27:41.322Z