Graph and network algorithms

Samir Khuller, Balaji Raghavachari

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Graphs are useful in modeling many problems from different scientific disciplines because they capture the basic concept of objects (vertices) and relationships between objects (edges). Indeed, many optimization problems can be formulated in graph theoretic terms. Hence, algorithms on graphs have been widely studied. In this chapter, a few fundamental graph algorithms are described. For a more detailed treatment of graph algorithms, the reader is referred to textbooks on graph algorithms [Cormen et al. 2001, Even 1979, Gibbons 1985, Tarjan 1983].

Original languageEnglish (US)
Title of host publicationComputer Science Handbook, Second Edition
PublisherCRC Press
Pages7-1-7-23
ISBN (Electronic)9780203494455
ISBN (Print)9781584883609
StatePublished - Jan 1 2004

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Graph and network algorithms'. Together they form a unique fingerprint.

Cite this