Combinatorial Problems Arising in Massive Data Sets

  • Fan Chung Graham
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)


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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Fan Chung Graham
    • 1
  1. 1.University of PennsylvaniaPhiladelphia

Personalised recommendations