Counting edge crossings in a 2-layered drawing

DOI10.1016/J.IPL.2004.05.001MaRDI QIDQ2390316zbMATHOpenAlexFDO

Authors Hiroshi Nagamochi, Nobuyasu Yamada

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.05.001

zbMATH Keywords

dynamic programminggraph algorithmscountingbipartite graphsgraph drawingdivide-and-conqueredge crossings

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1974114
• Simple and Efficient Bilayer Cross Counting
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Drawing bipartite graphs in two layers with specified crossings
• A faster fixed parameter algorithm for two-layer crossing minimization

Cites work

• scientific article; zbMATH DE number 1974114 (Why is no real title available?)
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Edge crossings in drawings of bipartite graphs
• Graph Drawing and Applications for Software and Knowledge Engineers

Cited in

(6)

• Drawing bipartite graphs in two layers with specified crossings
• scientific article; zbMATH DE number 1974114 (Why is no real title available?)
• A faster fixed parameter algorithm for two-layer crossing minimization
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• Approximation algorithms for minimizing edge crossings in radial drawings
• Simple and Efficient Bilayer Cross Counting

This page was built for publication: Counting edge crossings in a 2-layered drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390316)