PARALLEL DEPTH-1ST SEARCH IN GENERAL DIRECTED-GRAPHS

被引:29
|
作者
AGGARWAL, A
ANDERSON, RJ
KAO, MY
机构
[1] UNIV WASHINGTON,DEPT COMP SCI,SEATTLE,WA 98195
[2] DUKE UNIV,DEPT COMP SCI,DURHAM,NC 27706
[3] INDIANA UNIV,COMP SCI,BLOOMINGTON,IN 47405
关键词
D O I
10.1137/0219025
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A directed cycle separator of an n-vertex directed graph is a vertex-simple directed cycle such that when the vertices of the cycle are deleted, the resulting graph has no strongly connected component with more than n/2 vertices. It is shown that the problem of finding a directed cycle separator is in randomized NC. It is also proved that computing cycle separators and conducting depth-first search in directed graphs are deterministically NC-equivalent. These two results together yield the first randomized NC algorithm for depth-first search in general directed graphs.
引用
收藏
页码:397 / 409
页数:13
相关论文
共 50 条