Experiments on drawing 2-level hierarchical graphs

DOI10.1080/00207169008803941zbMath0723.68083OpenAlexW2076022481MaRDI QIDQ5895402

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/00207169008803941

zbMATH Keywords

graph drawinghierarchical graphsedge crossingbarycenter heuristicgreedy switchingmedian heuristic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Drawing graphs in two layers ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs ⋮ A tabu search algorithm for the bipartite drawing problem

Uses Software

• ALADDIN

Cites Work

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

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