The slotted online one-sided crossing minimization problem on 2-regular graphs

DOI10.1007/978-3-031-06678-8_18OpenAlexW4285139583MaRDI QIDQ2169959

Henri Lotze, Janosch Fuchs, Elisabet Burjons

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2201.04061

zbMATH Keywords

online algorithmsgraph drawingcrossing minimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• Edge crossings in drawings of bipartite graphs
• Algorithms for drawing graphs: An annotated bibliography
• On the one-sided crossing minimization in a bipartite graph with large degrees
• New bounds on the barycenter heuristic for bipartite graph drawing.
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• The graph crossing number and its variants: a survey
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Crossing Number is NP-Complete

This page was built for publication: The slotted online one-sided crossing minimization problem on 2-regular graphs