parallel algorithm
https://scigraph.springernature.com/explorer/license/
1992
problem
chapters
false
cotree representation
cotree
edge
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log2n) time with O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using O(log n) time with O(n) processors. We also present a parallel algorithm for the depthfirst spanning tree problem for permutation graphs (a class properly contains cographs) which takes O(log2n) time with O(n) processors.
permutation graphs
number
1992-01-01
number of vertices
cographs
94-105
applications
representation problem
chapter
representation
vertices
time
graph
Parallel algorithm for cograph recognition with applications
CRCW PRAM
PRAM
cograph recognition
permutation representation problem
2022-01-01T19:15
tree problem
processors
en
algorithm
depthfirst
https://doi.org/10.1007/3-540-55706-7_9
recognition
Nurmi
Otto
Esko
Ukkonen
Springer Nature
Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY
Department of Computer Science, State University of New York at Buffalo, 14260, Buffalo, NY
Xin
He
Information and Computing Sciences
pub.1043688111
dimensions_id
978-3-540-55706-7
978-3-540-47275-9
Algorithm Theory — SWAT '92
10.1007/3-540-55706-7_9
doi
Computation Theory and Mathematics
Springer Nature - SN SciGraph project