DAG—a program that draws directed graphs

DOI10.1002/spe.4380181104zbMath0661.68067OpenAlexW2086139432MaRDI QIDQ3811724

Emden R. Gansner, Kiem-Phong Vo, Stephen C. North

Publication date: 1988

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380181104

zbMATH Keywords

digraphdirected graphslayoutedge-list description

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Drawing graphs in two layers ⋮ HYPERSOLVER: A graphical tool for commonsense set theory ⋮ ARC crossing minimization in hierarchical digraphs with tabu search ⋮ Unnamed Item ⋮ An experimental comparison of four graph drawing algorithms. ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm ⋮ Heuristics and meta-heuristics for 2-layer straight line crossing minimization ⋮ Advances in the theory and practice of graph drawing ⋮ Edge crossings in drawings of bipartite graphs

This page was built for publication: DAG—a program that draws directed graphs