Experiments on drawing 2-level hierarchical graphs
From MaRDI portal
Publication:5899817
DOI10.1080/00207169008803921zbMath0701.68083MaRDI QIDQ5899817
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/00207169008803921
graph drawing; hierarchical graphs; edge crossing; barycenter heuristic; greedy switching; median heuristics
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Unnamed Item, Genetic algorithms for drawing bipartite graphs, ARC crossing minimization in hierarchical digraphs with tabu search, On the one-sided crossing minimization in a bipartite graph with large degrees, Heuristics and meta-heuristics for 2-layer straight line crossing minimization, New bounds on the barycenter heuristic for bipartite graph drawing., On drawing regular bipartite graphs
Uses Software
Cites Work