A simple parallel tree contraction algorithm
Journal of Algorithms
Parallel algorithms for cographs and parity graphs with applications
Journal of Algorithms
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel algorithm for cograph recognition with applications
Journal of Algorithms
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Discrete Applied Mathematics
An optimal parallel algorithm for node ranking of cographs
Discrete Applied Mathematics
Parallel Recognition of Complement Reducible Graphs and Cotree Construction
Parallel Recognition of Complement Reducible Graphs and Cotree Construction
An Optimal Parallel Co-Connectivity Algorithm
Theory of Computing Systems
Graphs and Hypergraphs
Efficient parallel recognition of cographs
Discrete Applied Mathematics
| Hi-index | 5.24 |
In this paper, we modify a known parallel cograph-recognition algorithm proposed by Nikolopoulos and Palios [S.D. Nikolopoulos, L. Palios, Efficient parallel recognition of cographs, Discrete Applied Mathematics 150 (1-3) (2005) 182-215] and provide a new analysis of the algorithm. Given an input graph G with n vertices and m edges, we obtain the following three results based on our analysis: 1.When G is k-regular for a fixed positive integer k, the cograph-recognition problem can be optimally solved in O(logn) time using O(n+mlogn) processors on an EREW PRAM. 2.When G is k-regular for k=O(loglogn), the cograph-recognition problem can be solved in O(lognloglogn) time using O(n+mlogn) processors on an EREW PRAM. 3.Given a positive integer @a=O(loglogn), the cograph-recognition problem can be solved in O(lognloglogn) time using O(n+mlogn) processors on an EREW PRAM, provided the number of vertices in G with degree larger than @a is at most O(logn). The above results improve upon the previously best known result, which took O(log^2n) time using O(n+mlogn) processors on an EREW PRAM.