Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph
暂无分享,去创建一个
[1] Shuji Tsukiyama,et al. A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..
[2] Susanne E. Hambrusch,et al. Finding Maximum Cliques on Circular-Arc Graphs , 1987, Inf. Process. Lett..
[3] Sumio Masuda,et al. Efficient Enumeration of Maximal and Maximum Independent Sets of an Interval Graph and a Circular-Arc Graph. , 1987 .
[4] Joseph Y.-T. Leung,et al. Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.
[5] Fanica Gavril,et al. Algorithms on circular-arc graphs , 1974, Networks.
[6] Don Coppersmith,et al. On the Asymptotic Complexity of Matrix Multiplication , 1982, SIAM J. Comput..
[7] Jorge Urrutia,et al. Finding maximum cliques in circle graphs , 1981, Networks.
[8] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[9] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[10] Norishige Chiba,et al. Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..
[11] Shuji Tsukiyama,et al. An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset , 1980, J. ACM.
[12] Toshinobu Kashiwabara,et al. Efficient algorithms for finding maximum cliques of an overlap graph , 1990, Networks.
[13] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[14] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .