IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v56y2013i1p113-130.html
   My bibliography  Save this article

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Author

Listed:
  • Svyatoslav Trukhanov
  • Chitra Balasubramaniam
  • Balabhaskar Balasundaram
  • Sergiy Butenko

Abstract

Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable. This paper proposes a general purpose exact algorithmic framework to solve this problem and investigates key algorithm design and implementation issues that are helpful in tailoring the general framework for specific graph properties. The performance of the algorithms so derived for the maximum s-plex and the maximum s-defective clique problems, which arise in network-based data mining applications, is assessed through a computational study. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Svyatoslav Trukhanov & Chitra Balasubramaniam & Balabhaskar Balasundaram & Sergiy Butenko, 2013. "Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations," Computational Optimization and Applications, Springer, vol. 56(1), pages 113-130, September.
    • Handle: RePEc:spr:coopap:v:56:y:2013:i:1:p:113-130
    DOI: 10.1007/s10589-013-9548-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9548-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-013-9548-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Benjamin McClosky & Illya V. Hicks, 2012. "Combinatorial algorithms for the maximum k-plex problem," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 29-49, January.
    2. Butenko, S. & Wilhelm, W.E., 2006. "Clique-detection models in computational biochemistry and genomics," European Journal of Operational Research, Elsevier, vol. 173(1), pages 1-17, August.
    3. E. C. Sewell, 1998. "A Branch and Bound Algorithm for the Stability Number of a Sparse Graph," INFORMS Journal on Computing, INFORMS, vol. 10(4), pages 438-447, November.
    4. Balabhaskar Balasundaram & Sergiy Butenko & Svyatoslav Trukhanov, 2005. "Novel Approaches for Analyzing Biological Networks," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 23-39, August.
    5. Pattillo, Jeffrey & Youssef, Nataly & Butenko, Sergiy, 2013. "On clique relaxation models in network analysis," European Journal of Operational Research, Elsevier, vol. 226(1), pages 9-18.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wolfler Calvo, 2017. "A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques," Working Papers 1723, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Zeynep Ertem & Eugene Lykhovyd & Yiming Wang & Sergiy Butenko, 2020. "The maximum independent union of cliques problem: complexity and exact approaches," Journal of Global Optimization, Springer, vol. 76(3), pages 545-562, March.
    3. Maciej Rysz & Mohammad Mirghorbani & Pavlo Krokhmal & Eduardo L. Pasiliao, 2014. "On risk-averse maximum weighted subgraph problems," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 167-185, July.
    4. Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wolfler Calvo, 2021. "A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1070-1090, July.
    5. Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
    6. Bruno Nogueira & Rian G. S. Pinheiro, 2020. "A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems," Annals of Operations Research, Springer, vol. 284(1), pages 367-400, January.
    7. Alexander Veremyev & Oleg A. Prokopyev & Sergiy Butenko & Eduardo L. Pasiliao, 2016. "Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs," Computational Optimization and Applications, Springer, vol. 64(1), pages 177-214, May.
    8. Zhou, Yi & Lin, Weibo & Hao, Jin-Kao & Xiao, Mingyu & Jin, Yan, 2022. "An effective branch-and-bound algorithm for the maximum s-bundle problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 27-39.
    9. Maciej Rysz & Foad Mahdavi Pajouh & Pavlo Krokhmal & Eduardo L. Pasiliao, 2018. "Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights," Annals of Operations Research, Springer, vol. 262(1), pages 89-108, March.
    10. Tuan Le & Jon M. Stauffer & Bala Shetty & Chelliah Sriskandarajah, 2023. "An optimization framework for analyzing dual‐donor organ exchange," Production and Operations Management, Production and Operations Management Society, vol. 32(3), pages 740-761, March.
    11. Timo Gschwind & Stefan Irnich & Isabel Podlinski, 2015. "Maximum Weight Relaxed Cliques and Russian Doll Search Revisited," Working Papers 1504, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 19 May 2015.
    12. Wayne Pullan, 2021. "Local search for the maximum k-plex problem," Journal of Heuristics, Springer, vol. 27(3), pages 303-324, June.
    13. Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wolfler Calvo, 2017. "Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques," Working Papers 1722, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    14. Şuvak, Zeynep & Altınel, İ. Kuban & Aras, Necati, 2020. "Exact solution algorithms for the maximum flow problem with additional conflict constraints," European Journal of Operational Research, Elsevier, vol. 287(2), pages 410-437.
    15. Zhuqi Miao & Balabhaskar Balasundaram, 2020. "An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 763-778, July.
    16. Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wol?er Calvo, 2015. "Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques," Working Papers 1520, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Veremyev, Alexander & Boginski, Vladimir & Pasiliao, Eduardo L. & Prokopyev, Oleg A., 2022. "On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs," European Journal of Operational Research, Elsevier, vol. 297(1), pages 86-101.
    2. Alexander Veremyev & Oleg A. Prokopyev & Sergiy Butenko & Eduardo L. Pasiliao, 2016. "Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs," Computational Optimization and Applications, Springer, vol. 64(1), pages 177-214, May.
    3. Veremyev, Alexander & Prokopyev, Oleg A. & Boginski, Vladimir & Pasiliao, Eduardo L., 2014. "Finding maximum subgraphs with relatively large vertex connectivity," European Journal of Operational Research, Elsevier, vol. 239(2), pages 349-362.
    4. Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
    5. Carvalho, Filipa D. & Almeida, M. Teresa, 2011. "Upper bounds and heuristics for the 2-club problem," European Journal of Operational Research, Elsevier, vol. 210(3), pages 489-494, May.
    6. Zhou, Yi & Lin, Weibo & Hao, Jin-Kao & Xiao, Mingyu & Jin, Yan, 2022. "An effective branch-and-bound algorithm for the maximum s-bundle problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 27-39.
    7. Rosanna Grassi & Paolo Bartesaghi & Stefano Benati & Gian Paolo Clemente, 2021. "Multi-Attribute Community Detection in International Trade Network," Networks and Spatial Economics, Springer, vol. 21(3), pages 707-733, September.
    8. Oleksandra Yezerska & Sergiy Butenko & Vladimir L. Boginski, 2018. "Detecting robust cliques in graphs subject to uncertain edge failures," Annals of Operations Research, Springer, vol. 262(1), pages 109-132, March.
    9. Oleksandra Yezerska & Foad Mahdavi Pajouh & Alexander Veremyev & Sergiy Butenko, 2019. "Exact algorithms for the minimum s-club partitioning problem," Annals of Operations Research, Springer, vol. 276(1), pages 267-291, May.
    10. Komusiewicz, Christian & Nichterlein, André & Niedermeier, Rolf & Picker, Marten, 2019. "Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments," European Journal of Operational Research, Elsevier, vol. 275(3), pages 846-864.
    11. Alexander Veremyev & Vladimir Boginski & Eduardo Pasiliao, 2015. "Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra," Journal of Global Optimization, Springer, vol. 61(1), pages 109-138, January.
    12. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
    13. Yezerska, Oleksandra & Mahdavi Pajouh, Foad & Butenko, Sergiy, 2017. "On biconnected and fragile subgraphs of low diameter," European Journal of Operational Research, Elsevier, vol. 263(2), pages 390-400.
    14. Chitra Balasubramaniam & Sergiy Butenko, 2017. "On robust clusters of minimum cardinality in networks," Annals of Operations Research, Springer, vol. 249(1), pages 17-37, February.
    15. Benjamin McClosky & Illya V. Hicks, 2012. "Combinatorial algorithms for the maximum k-plex problem," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 29-49, January.
    16. Buchanan, Austin & Sung, Je Sang & Boginski, Vladimir & Butenko, Sergiy, 2014. "On connected dominating sets of restricted diameter," European Journal of Operational Research, Elsevier, vol. 236(2), pages 410-418.
    17. 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.
    18. Zhuqi Miao & Balabhaskar Balasundaram, 2020. "An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 763-778, July.
    19. Bruno Nogueira & Rian G. S. Pinheiro, 2020. "A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems," Annals of Operations Research, Springer, vol. 284(1), pages 367-400, January.
    20. Stefano Coniglio & Stefano Gualandi, 2022. "Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1006-1023, March.

    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:coopap:v:56:y:2013:i:1:p:113-130. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.