Recognizing cographs and threshold graphs through a classification of their edges

Information Processing Letters

Volumn 74, Issue 3, 2000, Pages 129-139

  Nikolopoulos, Stavros D ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PARALLEL ALGORITHMS;

COGRAPHS; GRAPH PARTITION; THRESHOLD GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 0033743740     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00041-7     Document Type: Article

References (16)

1. Adhar G.S., Peng S. Parallel algorithms for cographs and parity graphs with applications. J. Algorithms. Vol. 11:1990;252-284.
2. De Agostino S., Petreschi R. Parallel recognition algorithms for graphs with restricted neighborhoods. Internat. J. Found. Comput. Sci. Vol. 1:1990;123-130.
3. Coppersmith A., Winogrand S. Matrix multiplication via arithmetic progression. J. Symbolic Comput. Vol. 9:1990;251-280.
4. Chvátal V., Hammer P.L. Set-patching and threshold graphs. Res. Report CORR-73-21:1973;University of Waterloo.
5. Corneil D.G., Lerchs H., Burlingham L. Complement reducible graphs. Discrete Appl. Math. Vol. 3:1981;163-174.
6. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. Vol. 14:1985;926-934.
7. Dahlhaus E. Efficient parallel recognition algorithms of cographs and distance hereditary graphs. Discrete Appl. Math. Vol. 57:1995;29-44.
8. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, Inc, New York.
9. Harary F. Graph Theory. 1969;Addison-Wesley, Reading, MA.
10. He X. Parallel algorithms for cographs with applications. Nurmi O., Ukkonen E. Algorithm Theory - SWAT '92. Lecture Notes in Comput. Sci. Vol. 621:1992;94-105 Springer, Berlin.
11. Kano M., Nikolopoulos S.D. On the structure of A-free graphs. Part II. TR-25-99:1999;Department of Computer Science, University of Ioannina.
12. Lerchs H. On cliques and kernels. March 1971;Department of Computer Science, Universtity of Toronto.
13. Lin R., Olariu S. An NC recognition algorithm for cographs. J. Parallel Distrib. Comput. Vol. 13:1991;76-90.
14. Nikolopoulos S.D. Constant-time parallel recognition of split graphs. Inform. Process. Lett. Vol. 54:1995;1-8.
15. Nikolopoulos S.D., Danielopoulos S.D. Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs. Comput. Math. Appl. Vol. 29:1995;47-57.
16. Wolk E.S. The comparability graph of a tree. Proc. Amer. Math. Soc. Vol. 13:1965;789-795.