Abstract
Solving real-world optimization problems frequently boils down to processing graphs. The graphs themselves are used to represent and structure relationships of the problem’s components. In this chapter we review external-memory (EM) graph algorithms for a few representative problems:
Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT) and by the DFG grant SA 933/1-1.
Partially supported by the Center of Excellence programme of the EU under contract number ICAI-CT-2000-70025. Parts of this work were done while the author was visiting the Computer and Automation Research Institute of the Hungarian Academy of Sciences, Center of Excellence, MTA SZTAKI, Budapest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Katriel, I., Meyer, U. (2003). Elementary Graph Algorithms in External Memory. In: Meyer, U., Sanders, P., Sibeyn, J. (eds) Algorithms for Memory Hierarchies. Lecture Notes in Computer Science, vol 2625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36574-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-36574-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00883-5
Online ISBN: 978-3-540-36574-7
eBook Packages: Springer Book Archive