Crossing minimization in linear embeddings of graphs

DOI10.1109/12.46286zbMath1395.68215OpenAlexW2153157180WikidataQ56689199 ScholiaQ56689199MaRDI QIDQ5375434

Sumio Masuda, Toshinobu Kashiwabara, Toshio Fujisawa, Kazuo Nakajima

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Algorithms for the fixed linear crossing number problem ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Book embeddings and crossing numbers ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Approximating the fixed linear crossing number ⋮ The complexity of SIMPLE MAX-CUT on comparability graphs ⋮ A branch-and-cut approach to the crossing number problem ⋮ A tighter insertion-based approximation of the crossing number ⋮ Line Crossing Minimization on Metro Maps ⋮ Fixed-parameter algorithms for protein similarity search under mRNA structure constraints ⋮ Unnamed Item ⋮ Upward Book Embeddings of st-Graphs ⋮ The Turing Test for Graph Drawing Algorithms ⋮ Crossing Minimisation Heuristics for 2-page Drawings

This page was built for publication: Crossing minimization in linear embeddings of graphs