New bounds on the barycenter heuristic for bipartite graph drawing

Information Processing Letters

Volumn 82, Issue 6, 2002, Pages 293-298

  Li, Xiao Yu ^a   Stallmann, Matthias F ^a  

^a North Carolina State University   (United States)

Author keywords

Barycenter heuristic; Graph drawing; Performance ratio

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

BARYCENTER HEURISTICS; GRAPH DRAWINGS;

HEURISTIC METHODS;

EID: 0037199009     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00297-6     Document Type: Article

References (11)

1. On an edge crossing problem
2. Drawing graphs in two layers
3. Edge crossings in drawings of bipartite graphs
4. Crossing number is NP-complete
5. Trees with Hamiltonian square
6. A new crossing number for bipartite graphs
7. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms
8. Experiments on drawing 2-level hierarchical graphs
9. A conjecture on the error bound of the barycenter heuristic
10. An approximation algorithm for the two-layered graph drawing problem