New bounds on the barycenter heuristic for bipartite graph drawing.

Xiao Yu Li Matthias F. M. Stallmann

Published in: Inf. Process. Lett. (2002)

Keyphrases

graph drawing
lower and upper bounds
lower bound
information visualization
upper bound
optimal solution
bipartite graph
worst case
information retrieval
optimal cost
simulated annealing
search algorithm
digital libraries
tabu search
graph model
open source
real valued
data analysis
case study