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

DOI10.1007/978-3-031-06678-8_18MaRDI QIDQ2169959zbMATH OpenOpenAlexFDO

Authors Elisabet Burjons, Janosch Fuchs, Henri Lotze

Publication date 30 August 2022

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

zbMATH Keywords

crossing minimizationgraph drawingonline algorithms

Mathematics Subject Classification ID

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

Cites work

• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• Algorithms for drawing graphs: An annotated bibliography
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Crossing Number is NP-Complete
• Edge crossings in drawings of bipartite graphs
• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• scientific article; zbMATH DE number 2084280 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• New bounds on the barycenter heuristic for bipartite graph drawing.
• On the one-sided crossing minimization in a bipartite graph with large degrees
• The graph crossing number and its variants: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169959)