A time-optimal solution for the path cover problem on cographs

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1541-1556

  Nakano, Koji ^a   Olariu, Stephan ^b   Zomaya, Albert Y ^c  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b Old Dominion University   (United States)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS; PARALLEL PROCESSING SYSTEMS;

HAMILTONIAN PATH; INFINITE NUMBERS; LOWER BOUNDS; OPTIMAL SOLUTIONS; PARALLEL SOLUTIONS; PATH COVER; TIME-OPTIMAL SOLUTION; VERTEX DISJOINT PATHS;

GRAPH THEORY;

EID: 85009188243     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00068-3     Document Type: Article

References (19)

1. [1] Abrahamson, K., Dadoun, N., Kirkpatrick, D.G., Przytycka, T., A simple parallel tree contraction algorithm. J. Algorithms 10 (1989), 287–302.
2. [2] G.S. Adhar, S. Peng, Parallel algorithm for path covering, Hamiltonian path, and Hamiltonian cycle in cographs, Proc. Internat. Conf. on Parallel Processing, Vol. III, 1990, pp. 364–365.
3. [3] Anderson, R.J., Miller, G.L., Deterministic parallel list ranking. Algorithmica 6 (1991), 859–868.
4. [4] Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, 1976, North-Holland, Amsterdam.
5. [5] Cole, R., Vishkin, U., Approximate parallel scheduling, Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comput. 17 (1988), 128–142.
6. [6] Cook, S.A., Dwork, C., Reischuk, R., Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15 (1986), 87–97.
7. [7] Corneil, D.G., Lerchs, H., Stewart Burlingham, L., Complement reducible graphs. Discrete Appl. Math. 3 (1981), 163–174.
8. [8] Garey, M.R., Johnson, D.S., Computers and Intractability, A Guide to the Theory of NP-completeness, 1979, Freeman, San Francisco.
9. [9] Gibbons, A., Rytter, W., Efficient Parallel Algorithms, 1989, Cambridge University Press, Cambridge.
10. [10] Gibbons, A., Rytter, W., Optimal parallel algorithms for dynamic expression evaluation and context-free recognition. Inform. Comput. 81 (1989), 32–45.
11. [11] X. He, Efficient parallel algorithms for solving some tree problems, Proc. 24-th Allerton Conf. on Communication, Control, and Computing, 1986, pp. 777–786.
12. [12] He, X., Parallel algorithm for cograph recognition with applications. J. Algorithms 15:2 (1993), 284–313.
13. [13] JáJá, J., An Introduction to Parallel Algorithms, 1992, Addison-Wesley, Reading, MA.
14. [14] Karp, R.M., Ramachandran, V., A survey of parallel algorithms for shared memory machines. van Leeuwen, J., (eds.) Handbook of Theoretical Computer Science, 1990, North-Holland, Amsterdam, 869–941.
15. [15] Kruskal, C.P., Rudolph, L., Snir, M., Efficient parallel algorithms for graph problems. Algorithmica 5 (1990), 43–64.
16. [16] Lin, R., Olariu, S., A fast recognition algorithm for cographs. J. Parallel Distrib. Comput. 13 (1991), 76–91.
17. [17] Lin, R., Olariu, S., Pruesse, G., An optimal path cover algorithm for cographs. Comput. Math. Appl. 30 (1995), 75–83.
18. [18] Lin, R., Olariu, S., Schwing, J.L., Zhang, J., A fast EREW algorithm for minimum path cover and hamiltonicity for cographs. Parallel Algorithms Appl. 2 (1994), 99–113.
19. [19] Tarjan, R.E., Vishkin, U., An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14 (1985), 862–874.