Abstract
We will discuss several combinatorial problems which are motivated by computational issues arising from the study of large graphs (having sizes far exceeding the size of the main memory). A variety of areas in graph theory are involved, including graph labeling, graph embedding, graph decomposition, and spectral graph theory as well as concepts from probabilistic methods and dynamic location/scheduling.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graham, F.C. (1998). Combinatorial Problems Arising in Massive Data Sets. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-68535-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64824-6
Online ISBN: 978-3-540-68535-7
eBook Packages: Springer Book Archive