Efficient algorithms for the domination problems on interval and circular-arc graphs

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1671-1694

  Chang, Maw Shang ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Circular arc graphs; Domination; Graph algorithms; Interval graphs

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

CIRCULAR-ARC GRAPHS; INTERVAL GRAPHS; WEIGHTED DOMINATION PROBLEM;

GRAPH THEORY;

EID: 0032321109     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792238431     Document Type: Article

References (40)

1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. T. ASANO, Dynamic programming on intervals, Lecture Notes in Computer Science 557, Springer-Verlag, New York, Berlin, 1991, pp. 199-207.
3. A. A. BERTOSSI, Total domination in interval graphs, Inform. Process. Lett., 23 (1986), pp. 131-134.
4. A. A. BERTOSSI AND M. A. BONUCCELLI, Some parallel algorithms on interval graphs, Discrete Appl. Math., 16 (1987), pp. 101-111.
5. A. A. BERTOSSI AND A. GORI, Total domination and irredundance in weighted interval graphs, SIAM J. Discrete Math., 1 (1988), pp. 317-327.
6. A. A. BERTOSSI AND S. MORETTI, Parallel algorithms on circular-arc graphs, Inform. Process. Lett., 33 (1989/1990), pp. 275-281.
7. P. VAN EMDE BOAS, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett., 6 (1977), pp. 80-82.
8. B. BOLLOBS AND E. J. COCKAYNE, Graph-theoretic parameters concerning domination, independence, and irredundance, J. Graph Theory, 3 (1979), pp. 241-249.
9. M. A. BONUCCELLI, Dominating sets and domatic number of circular-arc graphs, Discrete Appl. Math., 12 (1985), pp. 203-213.
10. K. S. BOOTH AND G. S. LUEKER, Testing for consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976), pp. 335-379.
11. M. S. CHANG, P. NAGAVAMSI, AND C. PANDU RANGAN, Weighted irredundancy in circular-arc graphs, manuscript, 1995.
12. E. J. COCKAYNE AND S. T. HEDETNIEMI, Towards a theory of domination in graphs, Networks, 7 (1977), pp. 247-261.
13. 2) algorithm for circular-arc graph recognition, in Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithm, Austin, TX, 1993, pp. 128-137.
14. M. FARBER, Domination, independent domination and duality in strongly chordal graphs, Discrete Appl. Math., 7 (1984), pp. 115-130.
15. H. N. GABOW AND R. E. TARJAN, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci., 30 (1985), pp. 209-221.
16. Z. GALIL AND G. F. ITALIANO, Data structures and algorithms for disjoint set union problems, ACM Comput. Surveys, 23 (1991), pp. 319-344.
17. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
18. F. GAVRIL, Algorithms on circular-arc graphs, Networks, 4 (1974), pp. 357-369.
19. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
20. M. C. GOLUMBIC, Interval graphs and related topics, Discrete Math., 55 (1985), pp. 113-243.
21. M. C. GOLUMBIC AND P. L. HAMMER, Stability in circular-arc graphs, J. Algorithms, 9 (1988), pp. 314-320.
22. U. I. GUPTA, D. T. LEE, AND J. Y. T. LEUNG, Efficient algorithms for interval graphs and circular-arc graphs, Networks, 12 (1982), pp. 459-467.
23. W. L. HSU, O(M · N) algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput., 24 (1995), pp. 411-439.
24. W. L. Hsu AND T. H. MA, Substitution decomposition on chordal graphs and applications, Lecture Notes in Computer Science 557, Springer-Verlag, Berlin, New York, 1991, pp. 52-60.
25. W. L. Hsu AND K. H. TSAI, Linear time algorithms on circular-arc graphs, Inform. Process. Lett., 40 (1991), pp. 123-129.
26. N. KORTE AND R. H. MÖHRING, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput., 18 (1989), pp. 68-81.
27. R. LASKAR, J. PFAFF, S. M. HEDETNIEMI, AND S. T. HEDETNIEMI, On the algorithmic complexity of total domination, SIAM J. Alg. Discrete Math., 5 (1984), pp. 420-425.
28. G. K. MANACHER AND T. A. MANKUS, Incorporating negative weight vertices in certain vertex-search graph algorithms, Inform. Process. Lett., 42 (1992), pp. 293-294.
29. S. MASUDA AND K. NAKAJIMA, An optimal algorithm for finding a maximum independent set of a circular-arc graph SIAM J. Comput., 17 (1988), pp. 41-52.
30. G. RAMALINGAN AND C. PANDU RANGAN, Total domination in interval graphs revisited, Inform. Process. Lett., 27 (1988), pp. 17-21.
31. G. RAMALINGAN AND C. PANDU RANGAN, A unified approach to domination problems on interval graphs, Inform. Process. Lett., 27 (1988), pp. 271-274.
32. G. RAMALINGAN AND C. PANDU RANGAN, New sequential and parallel algorithms for interval graph recognition, Inform. Process. Lett., 34 (1990), pp. 215-219.
33. A. SRINIVASA RAO AND C. PANDU RANGAN, Optimal parallel algorithms on circular-arc graphs, Inform. Process. Lett., 33 (1989/1990), pp. 147-156.
34. 2 logn) time algorithm for the Hamiltonian cycle problem, SIAM J. Comput., 21 (1992), pp. 1026-1046.
35. K. SIMON, A new simple linear algorithm to recognize interval graphs, Lecture Notes in Computer Science 553, Springer-Verlag, Berlin, New York, 1991, pp. 289-308.
36. A. . SPRAGUE AND K. H. KULKARNI, Optimal parallel algorithms for finding cut vertices and bridges of interval graphs, Inform. Process. Lett., 42 (1992), pp. 229-234.
37. R. E. TARJAN, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach., 26 (1975), pp. 215-225.
38. R. E. TARJAN, J. VAN LEEUWEN, Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., 31 (1984), pp. 245-281.
39. A. TUCKER, An efficient test for circular-arc graphs, SIAM J. Comput., 9 (1980), pp. 1-24.
40. M. S. YU AND C. H. YANG, A simple optimal parallel algorithm for the minimum coloring problem on interval graphs, Inform. Process. Lett., 48 (1993), pp. 47-51.