SORTING, MINIMAL FEEDBACK SETS, AND HAMILTON PATHS IN TOURNAMENTS

被引:24
作者
BARNOY, A
NAOR, J
机构
关键词
D O I
10.1137/0403002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:7 / 20
页数:14
相关论文
共 24 条
[1]   SORTING IN C LOG N PARALLEL STEPS [J].
AJTAI, M ;
KOMLOS, J ;
SZEMEREDI, E .
COMBINATORICA, 1983, 3 (01) :1-19
[2]  
AJTAI M, 1986, 18TH P ANN ACM S THE, P188
[3]   THE AVERAGE COMPLEXITY OF DETERMINISTIC AND RANDOMIZED PARALLEL COMPARISON-SORTING ALGORITHMS [J].
ALON, N ;
AZAR, Y .
SIAM JOURNAL ON COMPUTING, 1988, 17 (06) :1178-1192
[4]  
Alon N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P502, DOI 10.1109/SFCS.1986.57
[5]   EIGENVALUES, GEOMETRIC EXPANDERS, SORTING IN ROUNDS, AND RAMSEY THEORY [J].
ALON, N .
COMBINATORICA, 1986, 6 (03) :207-219
[6]  
ALON N, UNPUB MAXIMUM NUMBER
[7]  
ALON N, 1988, SIAM J DISCRETE MATH, V1, P269
[8]   TIGHT COMPARISON BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING [J].
AZAR, Y ;
VISHKIN, U .
SIAM JOURNAL ON COMPUTING, 1987, 16 (03) :458-464
[9]  
BEAME P, 1986, 18TH P ANN ACM S THE, P169
[10]  
Berge C., 1973, GRAPHS HYPERGRAPHS