论文信息 - Shifting Graphs and Their Applications

Shifting Graphs and Their Applications

Graphs that in a certain precise sense are rich in sets of vertex-disjoint paths are studied. Bounds are obtained on the minimum number of edges in such graphs, and these are used to deduce nonlinear lower bounds on the computational complexity of shifting, merging, and matching problems.

Leslie G. Valiant | Nicholas Pippenger | N. Pippenger | L. Valiant

[1] A. Joel. On permutation switching networks , 1968 .

[2] Abraham Waksman,et al. A Permutation Network , 1968, JACM.

[3] Journal of the Association for Computing Machinery , 1961, Nature.

[4] V. Benes,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[5] Jean Vuillemin,et al. An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract) , 1974, STOC '74.

[6] Edmund Arthur Lamagna. The complexity of monotone functions. , 1975 .

[7] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[8] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[9] E. A. Lamagna,et al. Combinational Complexity of Some Monotone Functions , 1974, SWAT.

[10] Andrew Chi-Chih Yao,et al. Lower Bounds on Merging Networks , 1974, J. ACM.

[11] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[12] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.