论文信息 - Maximum internally stable sets of a graph - 字舞流文

Maximum internally stable sets of a graph

H Frank | H. Frank | S. Hakimi | S. L Hakimi

[1] R. Z. Norman,et al. An algorithm for a minimum cover of a graph , 1959 .

[2] O. Ore. Theory of Graphs , 1962 .

[3] J. Edmonds. Covers and packings in a family of sets , 1962 .

[4] Claude Berge,et al. The Theory Of Graphs , 1962 .

[5] A. J. Goldman,et al. Optimal matchings and degree-constrained subgraphs , 1964 .

[6] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[7] C. T. Zahn,et al. Modification of Edmonds' maximum matching algorithm , 1965 .

[8] Claude Berge,et al. Programming, games and transportation networks , 1966 .