The algorithm design manual
A meta heuristic for graph drawing: learning the optimal graph-drawing method for clustered graphs
AVI '00 Proceedings of the working conference on Advanced visual interfaces
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Improving Walker's Algorithm to Run in Linear Time
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
RINGS: A Technique for Visualizing Large Hierarchies
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
H3: laying out large directed graphs in 3D hyperbolic space
INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
TopoLayout: Multilevel Graph Layout by Topological Features
IEEE Transactions on Visualization and Computer Graphics
Mapping and visualizing the internet
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visual comparison for information visualization
Information Visualization - Special issue on State of the Field and New Research Directions
| Hi-index | 0.00 |
Quasi-trees, namely graphs with tree-like structure, appear in many application domains, including bioinformatics and computer networks.Our new SPF approach exploits the structure of these graphs with a two-level approach to drawing, where the graph is decomposed into a tree of biconnected components. The low-level biconnected components are drawn with a force-directed approach that uses a spanning tree skeleton as a starting point for the layout. The higher-level structure of the graph is a true tree with meta-nodes of variable size that contain each biconnected component. That tree is drawn with a new area-aware variant of a tree drawing algorithm that handles high-degree nodes gracefully, at the cost of allowing edge-node overlaps. SPF performs an order of magnitude faster than the best previous approaches, while producing drawings of commensurate or improved quality.