Reformulations and complexity of the clique interdiction problem by graph mapping

被引：1
|
作者：
Mattia, Sara [1 ]
机构：
[1] CNR, Ist Anal Sistemi & Informat, Rome, Italy
来源：
DISCRETE APPLIED MATHEMATICS | 2024年 / 354卷
关键词：
Maximum clique; Bilevel programming; Edge clique interdiction; Node clique interdiction; Complexity; Single level reformulation; Facets; MAXIMUM CLIQUE; BOUND ALGORITHM; SET;
D O I：
10.1016/j.dam.2021.06.008
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We show how to solve a maximum clique problem on a given graph by an equivalent problem on an auxiliary graph. The transformation has interesting consequences in the bilevel setting. In fact, it allows to map a clique interdiction problem with edge interdiction into a clique interdiction problem with node interdiction. As a byproduct of the mapping, we can generalize to the edge interdiction problem complexity and algorithmic results that hold for the node interdiction problem. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：48 / 57
页数：10
相关论文
共 50 条
  • [31] Parameterized Complexity of Edge Interdiction Problems
    Guo, Jiong
    Shrestha, Yash Raj
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 166 - 178
  • [32] The clique number of the exact distance t-power graph: Complexity and eigenvalue bounds
    Abiad, Aida
    Ameli, Afrouz Jabal
    Reijnders, Luuk
    DISCRETE APPLIED MATHEMATICS, 2025, 363 : 55 - 70
  • [33] MAPPING PROBLEM AND GRAPH NUMBERING.
    Chen, Kuo Wei
    Irani, Keki B.
    Materials Engineering (Cleveland), 1980, : 41 - 46
  • [34] Mapping image restoration to a graph problem
    Ishikawa, H
    Geiger, D
    PROCEEDINGS OF THE IEEE-EURASIP WORKSHOP ON NONLINEAR SIGNAL AND IMAGE PROCESSING (NSIP'99), 1999, : 890 - 894
  • [35] On the generic complexity of the searching graph isomorphism problem
    Rybalov, Alexander
    GROUPS COMPLEXITY CRYPTOLOGY, 2015, 7 (02) : 191 - 193
  • [36] Generic case complexity of the Graph Isomorphism Problem
    Noskov, Gennady A.
    Rybalov, Alexander N.
    GROUPS COMPLEXITY CRYPTOLOGY, 2016, 8 (01) : 9 - 20
  • [37] COMPLEXITY OF THE HAMILTONIAN CYCLE IN REGULAR GRAPH PROBLEM
    PICOULEAU, C
    THEORETICAL COMPUTER SCIENCE, 1994, 131 (02) : 463 - 473
  • [38] On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
    Das, Bireswar
    Enduri, Murali Krishna
    Reddy, I. Vinod
    WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2018, 2018, 10755 : 252 - 264
  • [39] A heuristic for the deterministic interdiction problem
    Rocco, Claudio
    Hernández, Sara
    Ramírez-Márquez, José
    González, Belzyt
    Revista de la Facultad de Ingenieria, 2009, 24 (03): : 5 - 20
  • [40] Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs
    Lee, Chuan-Min
    SYMMETRY-BASEL, 2022, 14 (04):
12345