Article ID: | iaor20121101 |
Volume: | 32 |
Issue: | 3 |
Start Page Number: | 437 |
End Page Number: | 458 |
Publication Date: | Mar 2002 |
Journal: | Algorithmica |
Authors: | Abello , Buchsbaum , Westbrook |
Keywords: | optimization |
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, minimum spanning forests, bottleneck minimum spanning forests, maximal independent sets (randomized only), and maximal matchings in undirected graphs. Our I