A RANDOM NC-ALGORITHM FOR DEPTH 1ST SEARCH

被引：33
作者：
AGGARWAL, A
ANDERSON, RJ
机构：
[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
[2] UNIV WASHINGTON,DEPT COMP SCI,SEATTLE,WA 98195
来源：
COMBINATORICA | 1988年 / 8卷 / 01期
关键词：
D O I：
10.1007/BF02122548
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：1 / 12
页数：12
相关论文
共 16 条
[1]  
ANDERSON J, 1984, STANCS841003 STANF U
[2]   A PARALLEL ALGORITHM FOR THE MAXIMAL PATH PROBLEM [J].
ANDERSON, R .
COMBINATORICA, 1987, 7 (04) :315-326
[3]  
ANDERSON RJ, 1986, EXTENDED ABSTRACT MA
[4]   A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS [J].
COOK, SA .
INFORMATION AND CONTROL, 1985, 64 (1-3) :2-22
[5]  
ECKSTEIN D, 1977, P C THEORETICAL COMP, P21
[6]  
Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043
[7]  
GHOSH RK, 1984, BIT, V24, P134, DOI 10.1007/BF01937481
[8]   CONSTRUCTING A PERFECT MATCHING IS IN RANDOM NC [J].
KARP, RM ;
UPFAL, E ;
WIGDERSON, A .
COMBINATORICA, 1986, 6 (01) :35-48
[9]   APPLICATIONS OF A PLANAR SEPARATOR THEOREM [J].
LIPTON, RJ ;
TARJAN, RE .
SIAM JOURNAL ON COMPUTING, 1980, 9 (03) :615-627
[10]   MATCHING IS AS EASY AS MATRIX-INVERSION [J].
MULMULEY, K ;
VAZIRANI, UV ;
VAZIRANI, VV .
COMBINATORICA, 1987, 7 (01) :105-113
12