Crossing minimization in linear embeddings of graphs
From MaRDI portal
Cited in
(25)- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Crossing minimization in weighted bipartite graphs
- Algorithms for the fixed linear crossing number problem
- 1-page and 2-page drawings with bounded number of crossings per edge
- Approximating the fixed linear crossing number
- Algorithms for graphs embeddable with few crossings per edge
- Crossing Minimization in Storyline Visualization
- Crossing Minimisation Heuristics for 2-page Drawings
- Experimental evaluation of book drawing algorithms
- The Turing Test for Graph Drawing Algorithms
- scientific article; zbMATH DE number 7525513 (Why is no real title available?)
- Upward book embeddings of st-graphs
- The complexity of SIMPLE MAX-CUT on comparability graphs
- scientific article; zbMATH DE number 7236457 (Why is no real title available?)
- Parameterized algorithms for book embedding problems
- Crossing Minimization in Weighted Bipartite Graphs
- Line Crossing Minimization on Metro Maps
- Fundamentals of Computation Theory
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Book embeddings and crossing numbers
- Parameterized algorithms for fixed-order book drawing with few crossings per edge
- Eliminating crossings in ordered graphs
- Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing
- A branch-and-cut approach to the crossing number problem
- Crossing minimization in extended level drawings of graphs
This page was built for publication: Crossing minimization in linear embeddings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375434)
