论文信息 - In 0 D In * 4

In 0 D In * 4

-We introduce several new classes of graphs on which the maximum-weight clique problem is solvable in polynomial time. Their common feature, and the central idea of euw algorithms, is that every clique of any of-ou graphs is contained in some member of a polynomial-sized collection of induced subgraphs that are complements of bipartite graphs. -Our approach is quite gEneral, and might conceivably yield many other classes of raphs along with corresponding polynomial time algorithms. / / 1 ,-,

E. Balas

[1] Paul D. Seymour. Disjoint paths in graphs , 2006, Discret. Math..

[2] Egon Balas,et al. Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[3] George L. Nemhauser,et al. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles , 1981, Math. Program..

[4] Yossi Shiloach,et al. A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.

[5] George J. Minty,et al. On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[6] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[7] S. N. Maheshwari,et al. An O(|V|³) Algorithm for Finding Maximum Flows in Networks , 1978, Inf. Process. Lett..

[8] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[9] L. Lovász. On chromatic number of finite set-systems , 1968 .

[10] G. Dirac. On rigid circuit graphs , 1961 .

[11] Jan Mycielski. Sur le coloriage des graphs , 1955 .