Solving the path cover problem on circular-arc graphs by using an approximation algorithm

Discrete Applied Mathematics

Volumn 154, Issue 1, 2006, Pages 76-105

  Hung, Ruo Wei ^a   Chang, Maw Shang ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Circular arc graphs; Graph algorithms; Hamiltonian cycle; Hamiltonian path; Interval graphs; Path cover

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; HAMILTONIANS;

CIRCULAR-ARC GRAPHS; GRAPH ALGORITHMS; HAMILTONIAN CYCLE; HAMILTONIAN PATH; INTERVAL GRAPHS; PATH COVER;

PROBLEM SOLVING;

EID: 27744514080     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.07.002     Document Type: Article

References (43)

1. S.R. Arikati, and C.P. Rangan Linear algorithm for optimal path cover problem on interval graphs Inform. Process. Lett. 35 1990 149 153
2. A.A. Bertossi, and M.A. Bonuccelli Hamiltonian circuits in interval graph generalizations Inform. Process. Lett. 23 1986 195 200
3. F.T. Boesch, and J.F. Gimpel Covering the points a digraph with point-disjoint paths and its application to code optimization J. ACM 24 1977 192 198
4. M.A. Bonuccelli, and D.P. Bovet Minimum node disjoint path covering for circular-arc graphs Inform. Process. Lett. 8 1979 159 161
5. G.J. Chang Corrigendum to "The path-partition problem in block graphs" [Information Processing Letters 52 (1994) 317-322] Inform. Process. Lett. 83 2002 293
6. M.S. Chang, S.L. Peng, and J.L. Liaw Deferred-query - an efficient approach for some problems on interval and circular-arc graphs Proceedings of WADS'93, Montréal, Canada 1993 222 233
7. M.S. Chang, S.L. Peng, and J.L. Liaw Deferred-query: an efficient approach for some problems on interval graphs Networks 34 1999 1 10
8. M.S. Chang, S.C. Wu, G.J. Chang, and H.G. Yeh Hamiltonian problems on Ptolemaic graphs Proceedings of the Workshop on Algorithms and Theory of Computation, International Computer Symposium (ICS'00) Taiwan 2000 27 34
9. D.Z. Chen, D.T. Lee, R. Sridhar, and C.N. Sekharan Solving the all-pair shortest path query problem on interval and circular-arc graphs Networks 31 1998 249 258
10. P. Damaschke The Hamiltonian circuit problem for circle graphs is NP-complete Inform. Process. Lett. 32 1989 1 2
11. P. Damaschke Paths in interval graphs and circular arc graphs Discrete Math. 112 1993 49 64
12. P. Damaschke, J.S. Deogun, D. Kratsch, and G. Steiner Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm Order 8 1992 383 391
13. J.S. Deogun, and C. Riedesel Hamiltonian cycles in permutation graphs J. Combin. Math. Combin. Comput. 27 1998 161 200
14. J.S. Deogun, and G. Steiner Polynomial algorithms for Hamiltonian cycle in cocomparability graphs SIAM J. Comput. 23 1994 520 552
15. E.M. Eschen, and J. Spinrad An O (n 2 ) algorithm for circular-arc graph recognition Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA'93) 1993 128 137
16. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco, CA
17. M.C. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
18. M.C. Golumbic, and P.L. Hammer Stability in circular arc graphs J. Algorithms 9 1988 314 320
19. S.Y. Hsieh, C.W. Ho, T.S. Hsu, M.T. Ko, Efficient algorithms for the Hamiltonian problem on distance-hereditary graphs, in: Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON'02), Lecture Notes in Computer Science, vol. 2387, Springer, Berlin, 2002, pp. 77-86.
20. W.L. Hsu O (M · N ) algorithms for the recognization and isomorphism problems on circular-arc graphs SIAM J. Comput. 24 1995 411 439
21. W.L. Hsu, and K.H. Tsai Linear time algorithms on circular-arc graphs Inform. Process. Lett. 40 1991 123 129
22. R.W. Hung, M.S. Chang, Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, Theoret. Comput. Sci., to appear.
23. R.W. Hung, and M.S. Chang A simple linear algorithm for the connected domination problem in circular-arc graphs Discuss. Math. Graph Theory 24 2004 137 145
24. R.W. Hung, M.S. Chang, Finding a minimum path cover of a distance-hereditary graph in polynomial time, submitted.
25. R.W. Hung, S.C. Wu, and M.S. Chang Hamiltonian cycle problem on distance-hereditary graphs J. Inform. Sci. Eng. 19 2003 827 838
26. A. Itai, C.H. Papadimitriou, and J.L. Szwarcfiter Hamiltonian paths in grid graphs SIAM J. Comput. 11 1982 676 686
27. M.S. Krishnamoorthy An NP-hard problem in bipartite graphs SIGACT News 7 1976 26
28. Y.D. Liang, and G.K. Manacher An O (n log n ) algorithm for finding a minimal path cover in circular-arc graphs Proceedings of the ACM Conference on Computer Science 1993 390 397
29. Y.D. Liang, G.K. Manacher, C. Rhee, and T.A. Mankus A linear algorithm for finding Hamiltonian circuits in circular-arc graphs Proceedings of the 32nd Southeast ACM Conference 1994 15 22
30. R. Lin, S. Olariu, and G. Pruesse An optimal path cover algorithm for cographs Comput. Math. Appl. 30 1995 75 83
31. G.K. Manacher, T.A. Mankus, and C.J. Smith An optimum Θ (n log n ) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals Inform. Process. Lett. 35 1990 205 211
32. S. Masuda, and K. Nakajima An optimal algorithm for finding a maximum independent set of a circular-arc graph SIAM J. Comput. 17 1988 41 52
33. R.M. McConnell Linear-time recognition of circular-arc graphs Algorithmica 37 2003 93 147
34. S. Moran, and Y. Wolfstahl Optimal covering of cacti by vertex disjoint paths Theoret. Comput. Sci. 84 1991 179 197
35. S. Pinter, and Y. Wolfstahl On mapping processes to processors Internat. J. Parallel Programming 16 1987 1 15
36. C. Riedesel, and J.S. Deogun Permutation graphs: Hamiltonian paths J. Combin. Math. Combin. Comput. 19 1995 55 63
37. W.K. Shih, T.C. Chern, and W.L. Hsu An O (n 2 log n ) time algorithm for the Hamiltonian cycle problem on circular-arc graphs SIAM J. Comput. 21 1992 1026 1046
38. R. Srikant, R. Sundaram, K.S. Singh, and C.P. Rangan Optimal path cover problem on block graphs and bipartite permutation graphs Theoret. Comput. Sci. 115 1993 351 357
39. A. Tucker An efficient test for circular-arc graphs SIAM J. Comput. 9 1980 1 24
40. M.S. Waterman, and J.R. Griggs Interval graphs and maps of DNA Bull. Math. Biol. 48 1986 189 195
41. P.K. Wong Optimal path cover problem on block graphs Theoret. Comput. Sci. 225 1999 163 169
42. J.H. Yan, and G.J. Chang The path-partition problem in block graphs Inform. Process. Lett. 52 1994 317 322
43. H.G. Yeh, and G.J. Chang The path-partition problem in bipartite distance-hereditary graphs Taiwanese J. Math. 2 1998 353 360