Generating All Maximal Independent Sets on Trees in Lexicographic Order
暂无分享,去创建一个
[1] Joseph Y.-T. Leung,et al. Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.
[2] Robert E. Tarjan,et al. Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.
[3] H. J. Kahn. Book and publicationDesign automation of digital systems vol 1: Theory and techniques: Edited by Melvin A. Breuer, Prentice-Hall Inc., New Jersey (1972) £7.50, 420 pp , 1973 .
[4] Mihalis Yannakakis,et al. On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..
[5] Narsingh Deo,et al. Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.
[6] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[7] Martin Farber,et al. Independent domination in chordal graphs , 1982, Oper. Res. Lett..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] R. Read. Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .
[10] Shuji Tsukiyama,et al. A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..
[11] Eugene L. Lawler,et al. Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..