Crossing minimization in linear embeddings of graphs

DOI10.1109/12.46286MaRDI QIDQ5375434zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

Cited in

(23)

• scientific article; zbMATH DE number 7236457 (Why is no real title available?)
• The Turing Test for Graph Drawing Algorithms
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• Crossing minimization in weighted bipartite graphs
• Fundamentals of Computation Theory
• Algorithms for the fixed linear crossing number problem
• Crossing Minimization in Storyline Visualization
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
• Book embeddings and crossing numbers
• Upward book embeddings of st-graphs
• Line Crossing Minimization on Metro Maps
• Crossing Minimization in Weighted Bipartite Graphs
• Crossing minimization in extended level drawings of graphs
• 1-page and 2-page drawings with bounded number of crossings per edge
• Algorithms for graphs embeddable with few crossings per edge
• Approximating the fixed linear crossing number
• Experimental evaluation of book drawing algorithms
• Crossing Minimisation Heuristics for 2-page Drawings
• A branch-and-cut approach to the crossing number problem
• Parameterized algorithms for book embedding problems
• Parameterized algorithms for fixed-order book drawing with few crossings per edge
• The complexity of SIMPLE MAX-CUT on comparability graphs
• scientific article; zbMATH DE number 7525513 (Why is no real title available?)

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)