New bounds on the barycenter heuristic for bipartite graph drawing.
From MaRDI portal
Publication:1853018
DOI10.1016/S0020-0190(01)00297-6zbMath1051.68115MaRDI QIDQ1853018
Matthias F. M. Stallmann, Xiao Yu Li
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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