Crossing minimization in linear embeddings of graphs
From MaRDI portal
Publication:5375434
DOI10.1109/12.46286zbMATH Open1395.68215OpenAlexW2153157180WikidataQ56689199 ScholiaQ56689199MaRDI QIDQ5375434FDOQ5375434
Authors: Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa 
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.46286
Cited In (24)
- Crossing Minimisation Heuristics for 2-page Drawings
- A branch-and-cut approach to the crossing number problem
- Experimental evaluation of book drawing algorithms
- Parameterized algorithms for fixed-order book drawing with few crossings per edge
- Crossing Minimization in Weighted Bipartite Graphs
- Crossing minimization in extended level drawings of graphs
- A tighter insertion-based approximation of the crossing number
- Book embeddings and crossing numbers
- Line Crossing Minimization on Metro Maps
- Title not available (Why is that?)
- Approximating the fixed linear crossing number
- The Turing Test for Graph Drawing Algorithms
- Upward book embeddings of st-graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Crossing Minimization in Storyline Visualization
- Parameterized algorithms for book embedding problems
- 1-page and 2-page drawings with bounded number of crossings per edge
- Algorithms for the fixed linear crossing number problem
- Crossing minimization in weighted bipartite graphs
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Algorithms for graphs embeddable with few crossings per edge
- Title not available (Why is that?)
- The complexity of SIMPLE MAX-CUT on comparability graphs
- Fundamentals of Computation Theory
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)
