Improving Walker's Algorithm to Run in Linear Time

Authors:
Christoph Buchheim;Michael Jünger;Sebastian Leipert
Affiliations:
-;-;-
Venue:
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Year:
2002

Citing 4
Cited 12

A node-positioning algorithm for general trees

Software—Practice & Experience
On Finding Lowest Common Ancestors: Simplification and Parallelization

AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Tidier Drawings of Trees

IEEE Transactions on Software Engineering
Tidy Drawings of Trees

IEEE Transactions on Software Engineering

Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components

IEEE Transactions on Visualization and Computer Graphics
TopoLayout: Multilevel Graph Layout by Topological Features

IEEE Transactions on Visualization and Computer Graphics
Compact layout of layered trees

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
HDPV: interactive, faithful, in-vivo runtime state visualization for C/C++ and Java

Proceedings of the 4th ACM symposium on Software visualization
Geographical analysis of hierarchical business structures by interactive drill down

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Visualizing Argument Structure

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Technical Section: CGV-An interactive graph visualization system

Computers and Graphics
Quantifying the space-efficiency of 2D graphical representations of trees

Information Visualization
Drawing trees with perfect angular resolution and polynomial area

GD'10 Proceedings of the 18th international conference on Graph drawing
Analytical, visual and interactive concepts for geo-visual analytics

Journal of Visual Languages and Computing
Drawing unordered trees on k-grids

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Grouse: feature-based, steerable graph hierarchy exploration

EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization

Quantified Score

Hi-index	0.02

Visualization

Abstract

The algorithm of Walker [5] is widely used for drawing trees of unbounded degree, and it is widely assumed to run in linear time, as the author claims in his article. But the presented algorithm clearly needs quadraticrun time. We explain the reasons for that and present a revised algorithm that creates the same layouts in linear time.