Graph-Theoretic Foundations

  • Ananda S. ChowdhuryEmail author
  • Suchendra M. Bhandarkar
Part of the Advances in Computer Vision and Pattern Recognition book series (ACVPR)


In this chapter, we present some important concepts and algorithms from graph theory for the benefit of a general reader. These concepts and algorithms constitute the theoretical underpinnings of a variety of techniques used to solve the various problems that arise in the context of virtual craniofacial surgery. The focus of this chapter is to present the necessary graph-theoretic foundations for the research presented in the remainder of the monograph. The details of the graph-theoretic modeling of specific problems in the context of virtual craniofacial surgery, along with appropriate justifications, will be provided in later chapters. This chapter contains an introductory section, followed by three separate sections on graph matching, graph isomorphism, and network flow.


  1. 31.
    Papadimitriou CH, Steiglitz K, Combinatorial optimization: algorithms and complexity, Prentice Hall, India, 1982 Google Scholar
  2. 32.
    Bollobás B. (1998) Modern graph theory. Springer, New York Google Scholar
  3. 33.
    Christofides N (1975) Graph theory: an algorithmic approach. Academic Press, San Diego Google Scholar
  4. 34.
    Valiente G (2002) Algorithms on trees and graphs. Springer, Berlin–Heidelberg Google Scholar
  5. 35.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge Google Scholar
  6. 36.
    Ford LR Jr, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton Google Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  • Ananda S. Chowdhury
    • 1
    Email author
  • Suchendra M. Bhandarkar
    • 2
  1. 1.Department of Electronics & Telecommunication EngineeringJadavpur UniversityKolkataIndia
  2. 2.Department of Computer ScienceThe University of GeorgiaAthensUSA

Personalised recommendations