21 lines
1.1 KiB
BibTeX
21 lines
1.1 KiB
BibTeX
@incollection{goos_improving_2002,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Improving Walker’s Algorithm to Run in Linear Time},
|
||
volume = {2528},
|
||
isbn = {978-3-540-00158-4 978-3-540-36151-0},
|
||
url = {http://link.springer.com/10.1007/3-540-36151-0_32},
|
||
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.},
|
||
pages = {344--353},
|
||
booktitle = {Graph Drawing},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian},
|
||
editor = {Goodrich, Michael T. and Kobourov, Stephen G.},
|
||
editorb = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
|
||
editorbtype = {redactor},
|
||
urldate = {2024-04-14},
|
||
date = {2002},
|
||
langid = {english},
|
||
doi = {10.1007/3-540-36151-0_32},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
}
|