A Practical Minimum Spanning Tree Algorithm Using the Cycle Property (2003)

Cached

Download Links

by Irit Katriel , Peter Sanders , Jesper Larsson Träff
Venue:IN 11TH EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA), NUMBER 2832 IN LNCS
Citations:11 - 3 self

Documents Related by Co-Citation

549 Shortest connection networks and some generalizations – R C Prim - 1957
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
609 Data structures and network algorithms – R Tarjan - 1983
8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
451 On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem – J B Kruskal - 1956
2439 Modern Information Retrieval – Ricardo Baeza-Yates, Berthier Ribeiro-Neto - 1999
1746 Core Team. R: A Language and Environment for Statistical Computing. ISBN 3-900051-07-0. R Foundation for Statistical Computing – R Development - 2009
579 Fibonacci heaps and their uses in improved network optimization problems – M Fredman, R E Tarjan - 1987
653 An Introduction to Parallel Algorithms – J Jaja - 1992