Polynomial algorithm for finding the largest independent sets in graphs without forks

被引：65
|
作者：
Alekseev, VE [1 ]
机构：
[1] Nizhniy Novogorod State Univ, Nizhnii Novgorod 603600, Russia
来源：
DISCRETE APPLIED MATHEMATICS | 2004年 / 135卷 / 1-3期
关键词：
graph; independent set of vertices; claw-free graphs; polynomial algorithm;
D O I：
10.1016/S0166-218X(02)00290-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A fork is a graph that is obtained from K-1,K-3 by subdividing one edge. It is known [6-8] that for K-1,K-3-free graphs the problem of finding the largest independent set can be solved in a polynomial time. In this paper, we prove that this is also true for the wider class of fork-free graphs. (C) 2002 Elsevier B.V. All rights reserved.
引用
收藏
页码：3 / 16
页数：14
相关论文
共 50 条
  • [41] Triangle-Tilings in Graphs Without Large Independent Sets
    Balogh, Jozsef
    McDowell, Andrew
    Molla, Theodore
    Mycroft, Richard
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (04): : 449 - 474
  • [42] Algorithm for finding canonical sets of ground rewrite rules in polynomial time
    [J]. Gallier, Jean, 1600, (40):
  • [43] Polynomial algorithm for finding chromatic sum tor unicyclic and outerplanar graphs
    Kubicka, EM
    [J]. ARS COMBINATORIA, 2005, 76 : 193 - 201
  • [44] A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
    Kante, Mamadou Moustapha
    Limouzy, Vincent
    Mary, Arnaud
    Nourine, Lhouari
    Uno, Takeaki
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, 9224 : 138 - 153
  • [45] Independent sets in graphs
    Dainyak, Aleksandr B.
    Sapozhenko, Aleksandr A.
    [J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2016, 26 (06): : 323 - 346
  • [46] The second largest number of maximal independent sets in connected graphs with at most one cycle
    Jou, Min-Jen
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (03) : 192 - 201
  • [47] The second largest number of maximal independent sets in connected graphs with at most one cycle
    Min-Jen Jou
    [J]. Journal of Combinatorial Optimization, 2012, 24 : 192 - 201
  • [48] FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs
    Christian Blum
    Borja Calvo
    Maria J. Blesa
    [J]. Swarm Intelligence, 2015, 9 : 205 - 227
  • [49] FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs
    Blum, Christian
    Calvo, Borja
    Blesa, Maria J.
    [J]. SWARM INTELLIGENCE, 2015, 9 (2-3) : 205 - 227
  • [50] Experimental evaluation of the greedy and random algorithms for finding independent sets in random graphs
    Goldberg, M
    Hollinger, D
    Magdon-Ismail, M
    [J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 513 - 523
12345