The Graph Abstraction

  • Charles Lins
Part of the Springer Compass International book series (COMPASS)


Like sets, graphs are important mathematical entities. In mathematical texts graphs are typically placed in the category of algebraic structures. Arbitrary relationships between data items can often be represented naturally using directed and undirected graphs. Directed graphs can be used as a useful way of describing binary relations. Tree data structures are a special form of directed graph.


Directed Graph Undirected Graph Graph Object Unordered Pair Vertex Label 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA 1983.MATHGoogle Scholar
  2. [2]
    G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.Google Scholar
  3. [3]
    N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, NJ 1974.MATHGoogle Scholar
  4. [4]
    F. Harary, Graph Theory, Addison-Wesley, Reading, MA 1972.Google Scholar
  5. [5]
    E. Horowitz and S. Sahni, Fundamentals of Data Structures, Computer Science Press, Potomac, MD 1976.MATHGoogle Scholar
  6. [6]
    E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Reinhart and Winston, New York, NY 1976.Google Scholar
  7. [7]
    G.P. McKeown and V.J. Rayward-Smith, Mathematics for Computing, John Wiley & Sons, New York, NY 1982.Google Scholar
  8. [8]
    K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP- Completeness, Springer-Verlag, Berlin Heidelberg 1984.MATHGoogle Scholar
  9. [9]
    J.L. Mott, A. Kandel, and T.P. Baker, Discrete Mathematics for Computer Scientists, Reston Publishing Company, Reston, VA 1983.MATHGoogle Scholar
  10. [10]
    C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ 1982.MATHGoogle Scholar
  11. [11]
    R. Sedgewick, Algorithms, Addison-Wesley, Reading, MA 1983.MATHGoogle Scholar
  12. [12]
    R. Skvarcius and W. B. Robinson, Discrete Mathematics with Computer Science Applications, Benjamin/Cummings, Menlo Park, CA 1986.MATHGoogle Scholar
  13. [13]
    A.M. Tenenbaum and M.J. Augenstein, Data Structures Using Pascal, Prentice- Hall, Englewood Cliffs, NJ 1981.MATHGoogle Scholar
  14. [14]
    A. Tucker, Applied Combinatorics, John Wiley & Sons, New York, NY 1980.MATHGoogle Scholar
  15. [15]
    J.D. Wiest and F.K. Levy, A Management Guide to PERT/CPM: with GERT/PDM/DCPM and other Networks, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ 1977.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Charles Lins
    • 1
  1. 1.Apple Computer, Inc.CupertinoUSA

Personalised recommendations