weberknecht -- a One-Sided Crossing Minimization solver
Johannes Rauch
TL;DR
This paper introduces 'weberknecht', an exact solver and 'weberknecht_h', a heuristic solver, for the One-Sided Crossing Minimization problem, aiming to optimize graph layouts by reducing edge crossings.
Contribution
The paper presents the implementation of both an exact and a heuristic solver specifically designed for the One-Sided Crossing Minimization problem, advancing computational methods in graph drawing.
Findings
Exact solver 'weberknecht' effectively minimizes crossings.
Heuristic solver 'weberknecht_h' provides faster approximate solutions.
Both solvers improve graph layout quality in their respective contexts.
Abstract
We describe the implementation of the exact solver weberknecht and the heuristic solver weberknecht_h for the One-Sided Crossing Minimization problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Robotic Path Planning Algorithms · Computational Geometry and Mesh Generation