Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Consider that T. is a given spanning tree of an undirected graph G which contains a vertices and m (/spl ges/n-1) edges. ,  propose an O(m/p+log m)-time parallel algorithm using p processors on the EREW PRAM model to determine whether T is a depth-first-search tree of G. Our algorithm is optimal in time complexity and speed-up. >
['Jia-Shung Wang', 'Biing-Feng Wang', 'Chen-Hsing Peng']
I am writing a research paper on a idea Recognizing depth-first-search trees in parallel
[{"from": "human", "value": "I am writing a research paper on a idea Recognizing depth-first-search trees in parallel"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Consider that T. is a given spanning tree of an undirected graph G which contains a vertices and m (/spl ges/n-1) edges. ,  propose an O(m/p+log m)-time parallel algorithm using p processors on the EREW PRAM model to determine whether T is a depth-first-search tree of G. Our algorithm is optimal in time complexity and speed-up. >"}]