论文信息 - On a Circle-Cover Minimization Problem - 字舞流文

On a Circle-Cover Minimization Problem

D. T. Lee | C. C. Lee | D. Lee

[1] Fanica Gavril,et al. Algorithms on circular-arc graphs , 1974, Networks.

[2] Alan Tucker,et al. Structure theorems for some circular-arc graphs , 1974, Discret. Math..

[3] A. Tucker,et al. Coloring a Family of Circular Arcs , 1975 .

[4] Alan C. Tucker,et al. An Efficient Test for Circular-Arc Graphs , 1980, SIAM J. Comput..

[5] Joseph Y.-T. Leung,et al. Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[6] Fabrizio Luccio,et al. A Visibility Problem in VLSI Layout Compaction , 1984 .

[7] Wen-Lian Hsu,et al. Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs , 1985, SIAM J. Comput..