Detecting critical nodes in sparse graphs
- 1 July 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (7), 2193-2200
- https://doi.org/10.1016/j.cor.2008.08.016
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Modeling – path availability to support disaster vulnerability assessment of network infrastructureComputers & Operations Research, 2007
- The wireless network jamming problemJournal of Combinatorial Optimization, 2007
- Epidemic dynamics on complex networks*Progress in Natural Science: Materials International, 2006
- Identifying sets of key players in a social networkComputational and Mathematical Organization Theory, 2006
- A combinatorial algorithm for message scheduling on controller area networksInternational Journal of Operational Research, 2005
- A cutting plane algorithm for computing k-edge survivability of a networkEuropean Journal of Operational Research, 2004
- Efficient Immunization Strategies for Computer Networks and PopulationsPhysical Review Letters, 2003
- Uncloaking Terrorist NetworksFirst Monday, 2002
- Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions ApproachJournal of Algorithms, 1996
- Centrality in social networks conceptual clarificationSocial Networks, 1979