Path Problems in Complex Networks

Pavel Ghosh () and Arun Sen ()
Additional contact information
Pavel Ghosh: Arizona State University
Arun Sen: Arizona State University

Chapter Chapter 11 in Handbook of Optimization in Complex Networks, 2012, pp 279-335 from Springer

Abstract: 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.

Keywords: Short Path; Time Slot; Span Tree; Source Node; Destination Node (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-0754-6_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461407546

DOI: 10.1007/978-1-4614-0754-6_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().