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)

• A branch-and-cut approach to the crossing number problem
• Crossing Minimisation Heuristics for 2-page Drawings
• Experimental evaluation of book drawing algorithms
• Crossing minimization in extended level drawings of graphs
• Parameterized algorithms for fixed-order book drawing with few crossings per edge
• Crossing Minimization in Weighted Bipartite Graphs
• Book embeddings and crossing numbers
• Line Crossing Minimization on Metro Maps
• scientific article; zbMATH DE number 7236457 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 7525513 (Why is no real title available?)
• 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)