IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-4109-0_2.html
   My bibliography  Save this book chapter

Selected Topics in Critical Element Detection

In: Applications of Mathematics and Informatics in Military Science

Author

Listed:
  • Jose L. Walteros

    (University of Florida)

  • Panos M. Pardalos

    (University of Florida)

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.

Suggested Citation

  • Jose L. Walteros & Panos M. Pardalos, 2012. "Selected Topics in Critical Element Detection," Springer Optimization and Its Applications, in: Nicholas J. Daras (ed.), Applications of Mathematics and Informatics in Military Science, edition 127, chapter 0, pages 9-26, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-4109-0_2
    DOI: 10.1007/978-1-4614-4109-0_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huff, Johnathon D. & Leonard, William B. & Medal, Hugh R., 2022. "The wireless network jamming problem subject to protocol interference using directional antennas and with battery capacity constraints," International Journal of Critical Infrastructure Protection, Elsevier, vol. 39(C).
    2. Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2019. "Finding Critical Links for Closeness Centrality," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 367-389, April.
    3. Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2014. "An integer programming framework for critical elements detection in graphs," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 233-273, July.
    4. Masahiro Sasabe & Miyu Otani & Takanori Hara & Shoji Kasahara, 2024. "Path reachability including distance-constrained detours," Journal of Risk and Reliability, , vol. 238(1), pages 79-92, February.
    5. Bernardetta Addis & Roberto Aringhieri & Andrea Grosso & Pierre Hosteins, 2016. "Hybrid constructive heuristics for the critical node problem," Annals of Operations Research, Springer, vol. 238(1), pages 637-649, March.
    6. Chen, Wei & Jiang, Manrui & Jiang, Cheng & Zhang, Jun, 2020. "Critical node detection problem for complex network in undirected weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    7. Balasundaram, Balabhaskar & Borrero, Juan S. & Pan, Hao, 2022. "Graph signatures: Identification and optimization," European Journal of Operational Research, Elsevier, vol. 296(3), pages 764-775.
    8. Ventresca, Mario & Harrison, Kyle Robert & Ombuki-Berman, Beatrice M., 2018. "The bi-objective critical node detection problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 895-908.
    9. Bernardetta Addis & Roberto Aringhieri & Andrea Grosso & Pierre Hosteins, 2016. "Hybrid constructive heuristics for the critical node problem," Annals of Operations Research, Springer, vol. 238(1), pages 637-649, March.
    10. Xing Zhou & Wei Peng & Zhen Xu & Bo Yang, 2015. "Hardness Analysis and Empirical Studies of the Relations among Robustness, Topology and Flow in Dynamic Networks," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-29, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4614-4109-0_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.