Abstract

In this chapter network path problems arising in several different domains have been discussed. Based on the different characteristics of the paths typical to the nature of the application domain, a general classification of the problems has been made. The goal of path computation may be finding a single path or multiple paths between a source-destination node pair in a network. In case of multiple path computation, one may seek to find totally disjoint or partially disjoint paths. In this chapter, two problems corresponding to a single path scenario and two corresponding to a multiple path scenario have been discussed in four different subsections. In these subsections, the problems have been formally defined first, followed by discussion on the proposed algorithms for solution of the problems, complexity analysis and experimental results.

Original languageEnglish (US)
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages279-335
Number of pages57
DOIs
StatePublished - Jan 1 2012

Publication series

NameSpringer Optimization and Its Applications
Volume57
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'Path problems in complex networks'. Together they form a unique fingerprint.

  • Cite this

    Ghosh, P., & Sen, A. (2012). Path problems in complex networks. In Springer Optimization and Its Applications (pp. 279-335). (Springer Optimization and Its Applications; Vol. 57). Springer International Publishing. https://doi.org/10.1007/978-1-4614-0754-6_11