Dynamic programming on intervals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 557 LNCS, Issue , 1991, Pages 199-207

  Asano, Takao ^a  

^a SOPHIA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

CIRCULAR-ARC GRAPH; DOMINATING SETS; EFFICIENT IMPLEMENTATION; INTERSECTION MODEL; MAXIMUM WEIGHT CLIQUES; MINIMUM WEIGHT; OPTIMAL SEQUENTIAL; TIME ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 84936632763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54945-5_63     Document Type: Conference Paper

References (8)

1. T. Asano, An faster algorithm for finding a maximum weight clique of a circular-arc graph, Technical Report of Institut fur Operations Research, Universität Bonn, 90624-OR, 1990.
2. J.L. Bentley, Decomposable searching problems, Information Processing Letters, 8 (1979), pp.244-251.
3. A.A. Bertossi and S. Moretti, Parallel algorithms on circular-arc graphs Information Processing Letters, 33 (1989/1990), pp.275-281.
4. W.-L. Hsu, Maximum weight clique algorithms for circular-arc graphs and circle graphs, SIAM Journal on Computing, 14 (1985), pp. 224-231.
5. T. Kaji and A. Ohuchi, Optimal sequential partitions of graphs by branch and bound, Technical Report 90-AL-10, Information Processing Society of Japan, 1990.
6. B.W. Kernighan, Optimal sequential partitions of graphs, Journal of ACM, 18 (1971), pp.34-40.
7. F.P. Preparata and M.I. Shamos, Computational Geometry: An Intorduction, Springer-Verlag, New York, 1985.
8. W.-K. Shih and W.-L. Hsu, An O(n logn +m loglog n) maximum weight clique algorithm for circular-arc graphs, Information Processing Letters, 31 (1989), pp.129-134.