Abstract | ||
---|---|---|
In this paper, we propose a novel visualization framework called DAGView. The aim of DAGView is to produce clear visualizations of directed acyclic graphs in which every edge and the potential existence of a path can be immediately spotted by the user. Several criteria that users identified as important in a layout are met, such as underlying grid, crossings and bends that appear perpendicular. The main algorithm is based on the layout of directed acyclic graphs but can be extended to handle directed graphs with cycles and undirected graphs, taking into account user preferences and/or constraints. Important tasks that are used in user studies are performed efficiently within the DAGView framework. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-36763-2_44 | Graph Drawing |
Keywords | Field | DocType |
novel visualization framework,important task,acyclic graph,underlying grid,potential existence,dagview framework,main algorithm,account user preference,user study,clear visualization,large graph | Graph drawing,Modular decomposition,Indifference graph,Combinatorics,Computer science,Visualization,Directed graph,Theoretical computer science,Directed acyclic graph,Longest path problem,Grid | Conference |
Citations | PageRank | References |
7 | 0.54 | 22 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Evgenios M. Kornaropoulos | 1 | 69 | 7.16 |
Ioannis G. Tollis | 2 | 1240 | 162.75 |