摘要:
core.ac.uk
elsevier.com
sci-hub.se 参考文章(19)
C. Berge, Graphs and hypergraphs ,(1973)
Gert Sabidussi, The lexicographic product of graphs Duke Mathematical Journal. ,vol. 28, pp. 573- 578 ,(1961) , 10.1215/S0012-7094-61-02857-5
Jack Edmonds, Matroids and the greedy algorithm Mathematical Programming. ,vol. 1, pp. 127- 136 ,(1971) , 10.1007/BF01584082
L. Lovász, Normal hypergraphs and the perfect graph conjecture Discrete Mathematics. ,vol. 306, pp. 253- 267 ,(1972) , 10.1016/0012-365X(72)90006-4
Manfred W. Padberg, On the facial structure of set packing polyhedra Mathematical Programming. ,vol. 5, pp. 199- 215 ,(1973) , 10.1007/BF01580121
Ralph E. Gomory, Outline of an algorithm for integer solutions to linear programs Bulletin of the American Mathematical Society. ,vol. 64, pp. 275- 278 ,(1958) , 10.1090/S0002-9904-1958-10224-4
Jack Edmonds, Minimum partition of a matroid into independent subsets Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics. ,vol. 69B, pp. 67- ,(1965) , 10.6028/JRES.069B.004
Stephen A. Cook, The complexity of theorem-proving procedures symposium on the theory of computing. pp. 151- 158 ,(1971) , 10.1145/800157.805047
D. R. Fulkerson, Blocking and anti-blocking pairs of polyhedra Mathematical Programming. ,vol. 1, pp. 168- 194 ,(1971) , 10.1007/BF01584085
Manfred W. Padberg, Perfect zero–one matrices Mathematical Programming. ,vol. 6, pp. 180- 196 ,(1974) , 10.1007/BF01580235