Selected Topics in Critical Element Detection

Jose L. Walteros () and Panos M. Pardalos ()
Additional contact information
Jose L. Walteros: University of Florida
Panos M. Pardalos: University of Florida

Chapter Chapter 2 in Applications of Mathematics and Informatics in Military Science, 2012, pp 9-26 from Springer

Abstract: Abstract In this paper we consider the problem of detecting critical elements in networks. The objective of these problems is to identify a subset of elements (i.e., nodes, arcs, paths, cliques, etc.) whose deletion minimizes a given connectivity measure over the resulting network. This paper surveys some of the recent advances for solving these kinds of problems including heuristic, mathematical programming, approximated algorithms, and dynamic programming approaches.

Keywords: Critical element detection; Critical node problem; Critical clique detection (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (10)

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-4109-0_2

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

DOI: 10.1007/978-1-4614-4109-0_2

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 ().