PARALLELISM AND THE FEEDBACK VERTEX SET PROBLEM

被引:3
作者
BOVET, DP
DEAGOSTINO, S
PETRESCHI, R
机构
[1] Univ of Rome La Sapienza, Rome, Italy, Univ of Rome La Sapienza, Rome, Italy
关键词
* Research supported grant;
D O I
10.1016/0020-0190(88)90168-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:81 / 85
页数:5
相关论文
共 8 条
[1]  
BORODIN A, 1982, 14TH P ACM S THEOR C, P338
[2]  
Goldschlager L. M., 1977, SIGACT News, V9, P25, DOI 10.1145/1008354.1008356
[3]  
HIRSCHBERG DS, 1976, 8TH P ANN ACM S THEO, P55
[4]  
Karp R. M., 1972, COMPLEXITY COMPUTER, P85
[5]  
LADNER RE, 1975, ACM SIGACT NEWS, V7, P583
[6]   LINEAR TIME ALGORITHM FOR FINDING MINIMUM CUTSETS IN REDUCIBLE GRAPHS [J].
SHAMIR, A .
SIAM JOURNAL ON COMPUTING, 1979, 8 (04) :645-655
[7]  
VISHKIN U, 1983, 71 NEW YORK U COUR I
[8]   FEEDBACK VERTEX SETS AND CYCLICALLY REDUCIBLE GRAPHS [J].
WANG, CC ;
LLOYD, EL ;
SOFFA, ML .
JOURNAL OF THE ACM, 1985, 32 (02) :296-313