Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. [Conference Paper]
This is the latest version of this eprint.
Full text not available from this repository.
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 quadratic runtime. We explain the reasons for that and present a revised algorithm that creates the same layouts in linear time.
| Item Type: | Conference Paper |
|---|---|
| Classifications: | G Algorithms and Complexity > G.999 Others M Methods > M.900 Tree |
| ID Code: | 227 |
| Deposited By: | Martinez Leon, Victoria |
| Deposited On: | 19 Apr 2005 |
| Last Modified: | 18 Sep 2008 13:08 |
| Alternative Locations: | http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2528&spage=344 |
Available Versions of this Item
- Improving Walker's Algorithm to Run in Linear Time. (deposited 17 Jul 2003)
- Improving Walker's Algorithm to Run in Linear Time. (deposited 19 Apr 2005) [Currently Displayed]
Repository Staff Only: item control page
