Maximum weight independent set of circular-arc graph and its application
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Wen-Lian Hsu,et al. Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs , 1985, SIAM J. Comput..
[3] Peter L. Hammer,et al. Stability in Circular Arc Graphs , 1988, J. Algorithms.
[4] Fanica Gavril,et al. Algorithms on circular-arc graphs , 1974, Networks.
[5] Wen-Lian Hsu,et al. Linear Time Algorithms on Circular-Arc Graphs , 1991, Inf. Process. Lett..
[6] Joseph Y.-T. Leung,et al. Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.
[7] D. T. Lee,et al. Parallel Batched Planar Point Location on the CCC , 1989, Inf. Process. Lett..
[8] Kazuo Nakajima,et al. An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph , 1988, SIAM J. Comput..
[9] Wei-Kuan Shih,et al. An O(n log n+m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs , 1989, Inf. Process. Lett..
[10] Parallel Algorithms on Circular-Arc Graphs , 1990, Inf. Process. Lett..
[11] Madhumangal Pal,et al. A sequential algorithm for finding a maximum weight K-independent set on interval graphs , 1996, Int. J. Comput. Math..
[12] Joseph Y.-T. Leung,et al. Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.
[13] Madhumangal Pal,et al. An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs , 2001, Comput. Optim. Appl..