Experiments on drawing 2-level hierarchical graphs

DOI10.1080/00207169008803921zbMath0701.68083OpenAlexW4250369401MaRDI QIDQ5899817

Erkki Maekinen

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

zbMATH Keywords

graph drawinghierarchical graphsedge crossingbarycenter heuristicgreedy switchingmedian heuristics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (7)

ARC crossing minimization in hierarchical digraphs with tabu search ⋮ On drawing regular bipartite graphs ⋮ Genetic algorithms for drawing bipartite graphs ⋮ Unnamed Item ⋮ 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.

Uses Software

• ALADDIN

Cites Work

• Unnamed Item
• Unnamed Item
• Crossing Number is NP-Complete
• Crossing Theory and Hierarchy Mapping

This page was built for publication: Experiments on drawing 2-level hierarchical graphs