de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Engineering an External Memory Minimum Spanning Tree Algorithm

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44293

Dementiev,  Roman
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45344

Sanders,  Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45427

Schultes,  Dominik
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Dementiev, R., Sanders, P., Schultes, D., & Sibeyn, J. F. (2004). Engineering an External Memory Minimum Spanning Tree Algorithm. In 3rd IFIP International Conference on Theoretical Computer Science (TSC2004) (pp. 195-208). Norwell, USA: Kluwer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-292C-2
Zusammenfassung
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs. Our implementation indicates that this algorithm processes graphs only limited by the disk capacity of most current machines in time no more than a factor 2--5 of a good internal algorithm with sufficient memory space.