Experiments on drawing 2-level hierarchical graphs

DOI10.1080/00207169008803941MaRDI QIDQ5895402zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

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

barycenter heuristicedge crossinggraph drawinggreedy switchinghierarchical graphsmedian heuristic

Mathematics Subject Classification ID

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

Recommendations

• Experiments on drawing 2-level hierarchical graphs
• scientific article; zbMATH DE number 1974130
• Graph Drawing
• New bounds on the barycenter heuristic for bipartite graph drawing.
• Edge crossings in drawings of bipartite graphs

Cites work

• Crossing Number is NP-Complete
• Crossing Theory and Hierarchy Mapping
• scientific article; zbMATH DE number 3963860 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(6)

• 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
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Graph Drawing
• Experiments on drawing 2-level hierarchical graphs

Describes a project that uses

Uses Software

• ALADDIN

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895402)