1. A simple parallel tree contraction algorithm;Abrahamson;J. Algorithms,1989
2. G.S. Adhar, S. Peng, Parallel algorithms for finding minimal path cover, Hamiltonian path and Hamiltonian cycle in cographs, Technique Report UMIACSi-TR-89-64, University of Maryland, 1989
3. Parallel algorithms for cographs and parity graphs with applications;Adhar;J. Algorithms,1990
4. A parallel algorithm for maximum matching in cographs;Adhar;Congr. Numer.,1990
5. Graphs and Hypergraphs;Berge,1973