Counting edge crossings in a 2-layered drawing
From MaRDI portal
Publication:2390316
DOI10.1016/j.ipl.2004.05.001zbMath1192.68489OpenAlexW2011747057MaRDI QIDQ2390316
Nobuyasu Yamada, Hiroshi Nagamochi
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
dynamic programmingcountingbipartite graphsgraph algorithmsgraph drawingdivide-and-conqueredge crossings
Related Items
Cites Work