Parallel algorithm for cograph recognition with applications

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

Volumn 621 LNCS, Issue , 1992, Pages 94-105

  He, Xin ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

CO-GRAPHS; COGRAPH; DEPTH FIRST; PERMUTATION GRAPH; PERMUTATION REPRESENTATION; SPANNING TREE PROBLEMS;

GRAPH THEORY;

EID: 85029658474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55706-7_9     Document Type: Conference Paper

References (15)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick and T. Przytycka, A Simple Parallel tree Contraction Algorithm, J. Algorithms 10 (2), 1989, pp. 287–302.
2. G. S. Adhar and S. Peng, NC Algorithms for Complement Reducible Graphs and Parity Graphs, in Proc. Of International Conf. On Comput. And Info., 1989.
3. G. S. Adhar and S. Peng, Parallel Algorithms for Complement Reducible Graphs and Parity Graphs with Applications, in Proc. Workshop on Algorithms and Data Structures, 1989.
4. G. S. Adhar and S. Peng, Parallel Algorithms for Cographs and Parity Graphs with Applications, J. Algorithms 11, 1990, pp. 252–284.
5. G. S. Adhar and S. Peng, Parallel Algorithms for Finding Minimal Path Cover, Hamiltonian Path and Hamiltonian Cycle in Cographs, UMIACS-TR-89-64, Uni. Of Maryland, 1989.
6. R. Cole, Parallel Merge Sort, Proc. 27th IEEE Symposium on Foundation of Computer Science, 1986, pp. 511–517.
7. D. G. Cornell, H. Lerchs and L. Stewart Burlinham, Complement Reducible Graphs, Disc. Appl. Math. 3, 1981, pp. 163–174.
8. D. G. Corneil, Y. Perl and L. K. Stewart Burlinham, A Linear Recognition Algorithm for Cographs, SIAM J. On Computing 14 (4), 1985, pp. 926–934.
9. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
10. D. Helmbold and E. Mayr, Perfect Graphs and Parallel Algorithms, in Proc. 1986 Intl. Conf. On Parallel Processing, pp. 853–860.
11. H. A. Jung, On a Class of Posets and the Corresponding Comparability Graphs, J. Combinatorial Theory (B) 24, 1978, pp. 125–133.
12. D. G. Kirkpatrick and T. Przytycka, Parallel Recognition of Complement Reducible Graphs and Cotree Construction, TR 88-1, Department of Computer Science, University of British Columbia, 1988.
13. Lin and S. Olariu, An NC Algorithm for Cographs, Department of Computer Science, TR-89-32, Old Dominion University, 1989.
14. M. Novick, Fast Parallel Algorithms for the Modular Decomposition, TR 89-1016, Department of Computer Science, Cornell University, 1989.
15. D. P. Sumner, Dacey Graphs, J. Australian Math. Soc. 18 (4), 1974, pp. 492–502.