2000 character limit reached
weberknecht -- a One-Sided Crossing Minimization solver (2412.06361v1)
Published 9 Dec 2024 in cs.DS
Abstract: We describe the implementation of the exact solver weberknecht and the heuristic solver weberknecht_h for the One-Sided Crossing Minimization problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.