Graph Drawing

DOI10.1007/B94919MaRDI QIDQ5896909zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi

Publication date 11 August 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b94919

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved bound on the one-sided minimum crossing number in two-layered drawings
• On the one-sided crossing minimization in a bipartite graph with large degrees
• On bipartite drawings and the linear arrangement problem
• Crossing Minimization in Weighted Bipartite Graphs
• scientific article; zbMATH DE number 1974114

Cited in

(10)

• On the one-sided crossing minimization in a bipartite graph with large degrees
• An improved bound on the one-sided minimum crossing number in two-layered drawings
• scientific article; zbMATH DE number 2084271 (Why is no real title available?)
• Simple and Efficient Bilayer Cross Counting
• Bimodal Crossing Minimization
• scientific article; zbMATH DE number 1974114 (Why is no real title available?)
• Breaking cycles for minimizing crossings
• Approximating Crossing Minimization in Radial Layouts
• On the 2-layer window width minimization problem
• An FPT algorithm for bipartite vertex splitting

This page was built for publication: Graph Drawing

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