Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

Journal of Parallel and Distributed Computing

Volumn 64, Issue 1, 2004, Pages 48-67

  Nikolopoulos, Stavros D ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Complexity; Hamiltonian completion number; Hamiltonian cycles; Parallel algorithms; Quasi threshold graphs; Recognition; Tree representation

Indexed keywords

EID: 1642461510     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.08.004     Document Type: Article

References (32)

1. G. Adhar, S. Peng, Parallel algorithms for cographs and parity graphs with applications, J. Algorithms 11 (1990) 252-284.
2. S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1997.
3. A.A. Bertossi, The edge Hamiltonian problem is NP-hard, Inform. Process. Lett. 13 (1981) 159-177.
4. H.L. Bodlaender, R.H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math. 6 (1993) 181-188.
5. A. Brandstadt, B. Le, J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and its Applications, SIAM, Philadelphia, PA, 1999.
6. R.A. Brualdi, R.F. Shong, Hamiltonian line graphs, J. Graph Theory 5 (1981) 304-307.
7. V. Chvátal, P.L. Hammer, Set-packing and threshold graphs, Research Report CORR 73-21, University of Warerloo, 1973.
8. D.G Corneil, H. Lerches, L. Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
9. D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
10. E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance hereditary graphs, Discrete Appl. Math. 57 (1995) 29-44.
11. M.C. Golumbic, Trivially perfect graphs, Discrete Math. 24 (1978) 105-107.
12. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
13. S. Goodman, S. Hedetniemi, On the Hamiltonian completion problems, in: A. Dold, B. Eckman (Eds.), Graphs and Combinatorics, Lecture Notes in Mathematics, Vol. 406, Springer, Berlin, 1974, pp. 262-272.
14. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
15. F. Harary, S.D. Nikolopoulos, On complete systems of invariants for small graphs, Internat. J. Comput. Math. 64 (1997) 35-46.
16. X. He, Parallel algorithms for cographs recognition with applications, J. Algorithms 15 (1993) 284-313.
17. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
18. S.R. Kosaraju, A. Delcher, Optimal parallel evaluation of tree-structured computations by ranking, in Proceedings of AWOC'88, Springer-Verlag, 1988, pp. 101-110.
19. H. Lerchs, On cliques and kernels, Department of Computer Science, University of Toronto, March 1971.
20. R. Lin, S. Olariu, An NC recognition algorithm for cographs, J. Parallel Distrib. Comput. 13 (1991) 76-90.
21. R. Lin, S. Olariu, An optimal parallel matching algorithm for cographs, J. Parallel Distrib. Comput. 22 (1994) 26-36.
22. R. Lin, S. Olariu, G. Pruesse, An optimal path cover algorithm for cographs, Computers Math. Appl. 30 (1995) 75-83.
23. S. Ma, W.D. Wallis, J. Wu, Optimization problems on quasi-threshold graphs, J. Comb. Inform. System Sci. 14 (1989) 105-110.
24. K. Nakano, S. Olariu, A. Zomaya, A time-optimal solution for the path cover problem on cographs, Theoret. Comput. Sci. 290 (2003) 1541-1556.
25. S.D. Nikolopoulos, Constant-time parallel recognition of split graphs, Inform. Process. Lett. 54 (1995) 1-8.
26. S.D. Nikolopoulos, Recognizing cographs and threshold graphs through a classification of their edges, Inform. Process. Lett. 75 (2000) 129-139.
27. J. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann, Los Altos, CA, 1993.
28. E.S. Wolk, The comparability graph of a tree, Proc. Amer. Math. Soc. 3 (1962) 789-795.
29. E.S. Wolk, A note of the comparability graph of a tree, Proc. Amer. Math. Soc. 16 (1965) 17-20.
30. H.J. Veldman, A result on Hamiltonian line graphs involving restrictions on induced subgraphs, J. Graph Theory 12 (1988) 413-420.
31. J-H. Yan, J-J. Chen, G.J. Chang, Quasi-threshold graphs, Discrete Appl. Math. 69 (1996) 147-255.
32. S. Zhang, X. Li, H.J. Broersma, Heavy paths and cycles in weighted graphs, Discrete Math. 223 (2000) 327-336.