Identifying Critical Nodes in a Network

Ashwin Arulselvan () and Altannar Chinchuluun ()
Additional contact information
Ashwin Arulselvan: Strathclyde Business School
Altannar Chinchuluun: National University of Mongolia

A chapter in Handbook for Management of Threats, 2023, pp 325-339 from Springer

Abstract: Abstract In this chapter, we survey the work on four problems each involved in identifying critical nodes in a network from very different perspectives. We provide them as generalizations of classical graph problems but they can also be directly motivated from an application point of view. We formally introduce all four problems and briefly look at their characterizations. We also look into a few computational methods that were used in the literature to solve them. We conclude with some future lines of investigation on all these problems.

Keywords: Critical node detection; Maximum clique; Independent set; Vertex cover; Connectivity (search for similar items in EconPapers)
Date: 2023
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-3-031-39542-0_16

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

DOI: 10.1007/978-3-031-39542-0_16

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