New bounds on the barycenter heuristic for bipartite graph drawing.

DOI10.1016/S0020-0190(01)00297-6zbMath1051.68115OpenAlexW2014942297MaRDI QIDQ1853018

Xiao Yu Li, Matthias F. M. Stallmann

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00297-6

zbMATH Keywords

Graph drawingPerformance ratioBarycenter heuristic

Mathematics Subject Classification ID

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

Related Items (3)

The slotted online one-sided crossing minimization problem on 2-regular graphs ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ Crossing minimization in weighted bipartite graphs

Cites Work

• Edge crossings in drawings of bipartite graphs
• Drawing graphs in two layers
• Crossing Number is NP-Complete
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Trees with Hamiltonian square
• Experiments on drawing 2-level hierarchical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New bounds on the barycenter heuristic for bipartite graph drawing.