The complexity of constructing evolutionary trees using experiments (2001)

by Gerth Stølting Brodal , Rolf Fagerberg , Christian N. S. Pedersen , Anna Östlin
Citations:8 - 1 self

Active Bibliography

790 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
5 Design and Analysis of Data Structures for Dynamic Trees – Renato F. Werneck - 2006
573 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
729 Introduction to Algorithms (Second Edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
524 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
521 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
539 Topology Control of Multihop Wireless Networks using Transmit Power Adjustment – Ram Ramanathan , Regina Rosales-hain - 2000
441 Graph Drawing by Force-directed Placement – Thomas M. J. Fruchterman, Edward, Edward M. Reingold - 1991
429 The quadtree and related hierarchical data structures – Hanan Samet - 1984