MAXIMUM WEIGHT INDEPENDENT SET IN TREES

被引：3
|
作者：
PAWAGI, S [1 ]
机构：
[1] SUNY STONY BROOK,DEPT COMP SCI,STONY BROOK,NY 11794
来源：
BIT | 1987年 / 27卷 / 02期
关键词：
D O I：
10.1007/BF01934182
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：170 / 180
页数：11
相关论文
共 50 条
  • [31] A hybrid iterated local search heuristic for the maximum weight independent set problem
    Nogueira, Bruno
    Pinheiro, Rian G. S.
    Subramanian, Anand
    OPTIMIZATION LETTERS, 2018, 12 (03) : 567 - 583
  • [32] A hybrid iterated local search heuristic for the maximum weight independent set problem
    Bruno Nogueira
    Rian G. S. Pinheiro
    Anand Subramanian
    Optimization Letters, 2018, 12 : 567 - 583
  • [33] Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
    Doron-Arad, Ilan
    Shachnai, Hadas
    DISCRETE APPLIED MATHEMATICS, 2025, 361 : 453 - 464
  • [34] Neural Maximum Independent Set
    Pontoizeau, Thomas
    Sikora, Florian
    Yger, Florian
    Cazenave, Tristan
    MACHINE LEARNING AND PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2021, PT I, 2021, 1524 : 223 - 237
  • [35] An efficient pram algorithm for maximum-weight independent set on permutation graphs
    Saha A.
    Pal M.
    Pal T.K.
    Journal of Applied Mathematics and Computing, 2005, 19 (1-2) : 77 - 92
  • [36] THE STRUCTURE AND MAXIMUM NUMBER OF MAXIMUM INDEPENDENT SETS IN TREES
    ZITO, J
    JOURNAL OF GRAPH THEORY, 1991, 15 (02) : 207 - 221
  • [37] A new simple algorithm for the maximum-weight independent set problem on circle graphs
    Valiente, G
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 129 - 137
  • [38] A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
    Lozin, Vadim V.
    Milanic, Martin
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (04) : 595 - 604
  • [39] Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
    Gartland, Peter
    Lokshtanov, Daniel
    Masarik, Tomas
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Rzazewski, Pawel
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 683 - 691
  • [40] A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
    Lozin, Vadim V.
    Milanic, Martin
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 26 - 30
12345