论文信息 - Clustering and domination in perfect graphs - 字舞流文

Clustering and domination in perfect graphs

Yehoshua Perl | Derek G. Corneil | D. Corneil | Y. Perl

[1] Martin Farber,et al. Domination in Permutation Graphs , 1985, J. Algorithms.

[2] L. Lovász,et al. Polynomial Algorithms for Perfect Graphs , 1984 .

[3] Kellogg S. Booth,et al. Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[4] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..

[5] Yehoshua Perl,et al. Efficient Optimization of Monotonic Functions on Trees , 1981, CAAP.

[6] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Stephen T. Hedetniemi,et al. A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[9] 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..