Augmenting graphs for independent sets

被引：19
|
作者：
Alekseev, VE
Lozin, VV
机构：
[1] Univ Nizhny Novgorod, Nizhnii Novgorod 603950, Russia
[2] Rutgers State Univ, RUTCOR, Piscataway, NJ 08854 USA
来源：
DISCRETE APPLIED MATHEMATICS | 2004年 / 145卷 / 01期
关键词：
independent set; augmenting graph; polynomial algorithm;
D O I：
10.1016/j.dam.2003.09.003
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider a general approach to solve the maximum independent set problem based on finding augmenting graphs. For some special classes of graphs, the approach provides polynomial solutions. In this paper we survey classical and recent results on the topic, and describe a new one that generalizes two previously known algorithms. We also discuss some open questions related to the notion of augmenting graphs. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：3 / 10
页数：8
相关论文
共 50 条
  • [1] Independent sets in graphs
    Dainyak, Aleksandr B.
    Sapozhenko, Aleksandr A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (06): : 323 - 346
  • [2] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
  • [3] On Independent Sets in Random Graphs
    Coja-Oghlan, Amin
    Efthymiou, Charilaos
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 436 - 486
  • [4] On independent sets in random graphs
    Coja-Oghlan, Amin
    Efthymiou, Charilaos
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 136 - 144
  • [5] On Independent Sets and Bicliques in Graphs
    Serge Gaspers
    Dieter Kratsch
    Mathieu Liedloff
    Algorithmica, 2012, 62 : 637 - 658
  • [6] ON UNIQUE INDEPENDENT SETS IN GRAPHS
    SIEMES, W
    TOPP, J
    VOLKMANN, L
    DISCRETE MATHEMATICS, 1994, 131 (1-3) : 279 - 285
  • [7] INDEPENDENT SETS IN REGULAR GRAPHS
    ROSENFELD, M
    ISRAEL JOURNAL OF MATHEMATICS, 1964, 2 (04) : 262 - +
  • [8] On Independent Sets and Bicliques in Graphs
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2008, 5344 : 171 - +
  • [9] On Independent Sets and Bicliques in Graphs
    Gaspers, Serge
    Kratsch, Dieter
    Liedloff, Mathieu
    ALGORITHMICA, 2012, 62 (3-4) : 637 - 658
  • [10] Counting independent sets in graphs
    Samotij, Wojciech
    EUROPEAN JOURNAL OF COMBINATORICS, 2015, 48 : 5 - 18
12345