On easy and hard hereditary classes of graphs with respect to the independent set problem
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Decomposition by clique separators , 1985, Discret. Math..
[2] Raffaele Mosca,et al. On (P5, diamond)-free graphs , 2002, Discret. Math..
[3] A. A. Li︠a︡punov. Problems in Cybernetics , 1961, Nature.
[4] Raffaele Mosca,et al. Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs , 1997, Inf. Process. Lett..
[5] George J. Minty,et al. On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.
[6] Egon Balas,et al. On graphs with polynomially solvable maximum-weight clique problem , 1989, Networks.
[7] Shuji Tsukiyama,et al. A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..
[8] Vadim V. Lozin,et al. On the stable set problem in special P5-free graphs , 2003, Discret. Appl. Math..
[9] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..
[10] Vadim V. Lozin,et al. A note on alpha-redundant vertices in graphs , 2001, Discret. Appl. Math..
[11] S. Poljak. A note on stable sets and colorings of graphs , 1974 .