Maximum independent set and maximum clique algorithms for overlap graphs

被引:15
|
作者
Cenek, E
Stewart, L [1 ]
机构
[1] Univ Alberta, Dept Comp Sci, Edmonton, AB, Canada
[2] Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada
关键词
overlap graphs; independent set; clique; algorithm; subtrees in a tree; subtree overlap graphs;
D O I
10.1016/S0166-218X(02)00418-3
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We give polynomial time algorithms for the maximum independent set and maximum clique problems for classes of overlap graphs, assuming an overlap model is provided as input. The independent set algorithm applies to any class of overlap graphs for which the maximum weight independent set problem is polynomially solvable on the corresponding intersection graph class, where the vertex weights are nonnegative integers on which arithmetic operations can be performed in constant time. The maximum clique algorithm requires only that the overlap model satisfy the Helly property. In both cases, the size of the overlap model must be bounded by a polynomial in the size of the graph. The conditions for both algorithms are satisfied by the class of overlap graphs of subtrees in a tree, which contains chordal graphs, circle graphs, circular-arc graphs, cocomparability graphs, and polygon-circle graphs. (C) 2002 Elsevier B.V. All rights reserved.
引用
收藏
页码:77 / 91
页数:15
相关论文
共 50 条
  • [1] EFFICIENT ALGORITHMS FOR THE MAXIMUM WEIGHT CLIQUE AND MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS ON PERMUTATION GRAPHS
    CHANG, MS
    WANG, FH
    [J]. INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 293 - 295
  • [2] Solving maximum clique and independent set of graphs based on Hopfield network
    Zhang, Y
    Chi, CH
    [J]. HIGH-PERFORMANCE COMPUTING AND NETWORKING, PROCEEDINGS, 1999, 1593 : 1258 - 1261
  • [3] Algorithms for Maximum Independent Set in Convex Bipartite Graphs
    Soares, Jose
    Stefanes, Marco A.
    [J]. ALGORITHMICA, 2009, 53 (01) : 35 - 49
  • [4] Algorithms for Maximum Independent Set in Convex Bipartite Graphs
    José Soares
    Marco A. Stefanes
    [J]. Algorithmica, 2009, 53 : 35 - 49
  • [5] Sticker model for maximum clique problem and maximum independent set
    Fan, Yue-Ke
    Qiang, Xiao-Li
    Xu, Jin
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (02): : 305 - 310
  • [6] Fast Maximum Clique Algorithms for Large Graphs
    Rossi, Ryan A.
    Gleich, David F.
    Gebremedhin, Assefaw H.
    Patwary, Md Mostofa Ali
    [J]. WWW'14 COMPANION: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2014, : 365 - 366
  • [7] On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree
    Ngoc C. Lê
    Trung Tran
    [J]. Acta Mathematica Vietnamica, 2020, 45 : 463 - 475
  • [8] On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree
    Le, Ngoc C.
    Trung Tran
    [J]. ACTA MATHEMATICA VIETNAMICA, 2020, 45 (02) : 463 - 475
  • [9] NEW CLIQUE AND INDEPENDENT SET ALGORITHMS FOR CIRCLE GRAPHS
    APOSTOLICO, A
    ATALLAH, MJ
    HAMBRUSCH, SE
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 36 (01) : 1 - 24
  • [10] Exact Algorithms for Maximum Independent Set
    Xiao, Mingyu
    Nagamochi, Hiroshi
    [J]. ALGORITHMS AND COMPUTATION, 2013, 8283 : 328 - 338