论文信息 - A parallel algorithm for bisection width in trees

A parallel algorithm for bisection width in trees

Abstract The bisection width b ( G ) of a graph G is the number of edges necessary in an edge cut of G so that the two sides of the cut have equal (within one element) size. Our main result is an O ( n 2 ) processor O (log 2 n loglog n ) time parallel algorithm for determining b ( T ) when T is a tree.

Zevi Miller | M. Goldberg | M. Goldberg | Zevi Miller

[1] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[2] Robert Malcolm Macgregor,et al. On partitioning a graph: a theoretical and empirical study. , 1978 .

[3] Frank Thomson Leighton,et al. Graph Bisection Algorithms with Good Average Case Behavior , 1984, FOCS.

[4] A. Hoffman,et al. Partitioning, Spectra and Linear Programming , 1984 .

[5] Frank Thomson Leighton,et al. Graph bisection algorithms with good average case behavior , 1984, Comb..

[6] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[7] Nicholas Pippenger,et al. On Simultaneous Resource Bounds (Preliminary Version) , 1979, FOCS 1979.

[8] Uzi Vishkin,et al. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[9] Frank Harary,et al. Graph Theory , 2016 .

[10] Peter Grogono. Programming in PASCAL , 1980 .

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