Path problems in complex networks

Pavel Ghosh, Arunabha Sen

Research output: Chapter in Book/Report/Conference proceedingChapter


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
Number of pages57
StatePublished - 2012

Publication series

NameSpringer Optimization and Its Applications

ASJC Scopus subject areas

  • Control and Optimization


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

Cite this