Experiments on drawing 2-level hierarchical graphs
From MaRDI portal
Publication:5895402
DOI10.1080/00207169008803941zbMath0723.68083MaRDI QIDQ5895402
Publication date: 1990
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803941
graph drawing; hierarchical graphs; edge crossing; barycenter heuristic; greedy switching; median heuristic
68R10: Graph theory (including graph drawing) in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs, Drawing graphs in two layers, A tabu search algorithm for the bipartite drawing problem
Uses Software
Cites Work