Ki-covers I: Complexity and polytopes
暂无分享,去创建一个
[1] Martin Grötschel,et al. Facets of the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..
[2] D. Corneil,et al. A dynamic programming approach to the dominating set problem on k trees , 1987 .
[3] Martin Grötschel,et al. Weakly bipartite graphs and the Max-cut problem , 1981, Oper. Res. Lett..
[4] Martin Grötschel,et al. On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..
[5] Leslie E. Trotter,et al. A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..
[6] Mouloud Boulala,et al. Polytope des independants d'un graphe serie-parallele , 1979, Discret. Math..
[7] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[8] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[9] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[10] Ali Ridha Mahjoub,et al. On the cut polytope , 1986, Math. Program..
[11] Robert E. Tarjan,et al. Algorithmic aspects of vertex elimination , 1975, STOC.
[12] Mihalis Yannakakis,et al. Edge-Deletion Problems , 1981, SIAM J. Comput..
[13] V. Chvátal. On certain polytopes associated with graphs , 1975 .
[14] Bert Gerards. Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..
[15] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..
[16] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..
[17] Ali Ridha Mahjoub,et al. Ki-covers. II. Ki-perfect graphs , 1987, J. Graph Theory.
[18] E. Balas,et al. Set Partitioning: A survey , 1976 .