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 条
  • [1] A faster algorithm for finding maximum independent sets in sparse graphs
    Fürer, M
    [J]. LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 491 - 501
  • [2] A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs
    Raymundo Marcial-Romero, J.
    Luna, Guillermo De Ita
    Lopez-Lopez, Aurelio
    Maria Valdovinos, Rosa
    [J]. 2016 FIFTEENTH MEXICAN INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (MICAI): ADVANCES IN ARTIFICIAL INTELLIGENCE, 2016, : 106 - 110
  • [3] A Graph Polynomial for Independent Sets of Bipartite Graphs
    Ge, Q.
    Stefankovic, D.
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (05): : 695 - 714
  • [4] A graph polynomial for independent sets of bipartite graphs
    Ge, Qi
    Stefankovic, Daniel
    [J]. IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 240 - 250
  • [5] A note on the Greedy algorithm for finding independent sets of Ck-free graphs
    Koura, Ippei
    Ono, Takao
    Hirata, Tomio
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (10) : 485 - 489
  • [6] On graphs with the third largest number of maximal independent sets
    Hua, Hongbo
    Hou, Yaloping
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (04) : 248 - 253
  • [7] Graphs with the second largest number of maximal independent sets
    Jin, Zemin
    Li, Xueliang
    [J]. DISCRETE MATHEMATICS, 2008, 308 (23) : 5864 - 5870
  • [8] On the Third Largest Number of Maximal Independent Sets of Graphs
    Shuchao Li
    Huihui Zhang
    [J]. Bulletin of the Malaysian Mathematical Sciences Society, 2016, 39 : 269 - 282
  • [9] On the Third Largest Number of Maximal Independent Sets of Graphs
    Li, Shuchao
    Zhang, Huihui
    [J]. BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2016, 39 : S269 - S282
  • [10] The largest number of maximal independent sets in twinkle graphs
    Lin, Jenq-Jong
    Jou, Min-Jen
    [J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 109 : 3 - 13
12345