Breaking cycles for minimizing crossings

DOI10.1145/945394.945396MaRDI QIDQ5269367zbMATH OpenOpenAlexWikidataFDO

Authors Camil Demestrescu, Irene Finocchi

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/945394.945396

zbMATH Keywords

bipartite graphscrossing minimizationexperimental algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• On the one-sided crossing minimization in a bipartite graph with large degrees
• Approximating Crossing Minimization in Radial Layouts
• Edge crossings in drawings of bipartite graphs
• Graph Drawing

Cited in

(11)

• Approximating Crossing Minimization in Radial Layouts
• On the complexity of crossings in permutations
• Crossing minimization in weighted bipartite graphs
• Bimodal Crossing Minimization
• A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• Approximation algorithms for minimizing edge crossings in radial drawings
• \(k\)-level crossing minimization is NP-hard for trees
• New Approximation to the One-sided Radial Crossing Minimization
• Graph Drawing
• An exact method for the minimum feedback arc set problem

This page was built for publication: Breaking cycles for minimizing crossings

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