Abstract
It is well known that for each k≥3 there exists such a constant c k and such an infinite sequence {G n} n=8∞ of k-degree graphs (each G n has exactly n vertices) that the bisection width of G n is at least c k ·n. It this paper some upper bounds on ck's are found. Let σk(n) be the maximum of bisection widths of all k-bounded graphs of n vertices. We prove that
for all k=2r, r≥2. This result is improved for k=4 by constructing two algorithms A and B, where for a given 4-degree-bounded graph G n of n vertices
-
(i)
A constructs a bisection of G n involving at most n/2+4 edges for even n≤76 (i.e., σ4(n)≤n/2+4 for even n≤76)
-
(ii)
B constructs a bisection of G n involving at most n/2+2 edges for n≥256 (i.e. σ4(n)≤n/2+2 for n≥256).
The algorithms A and B run in O(n 2) time on graphs of n vertices, and they are used to optimize hardware by building large transputer systems.
extended abstract
On the leave of Comenius University, Bratislava
The work of this author has been supported by the grant Mo 285/4-1 from the German Research Association (DFG)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon: Eigenvalues and expanders. Combinatorica 6 (1986), 85–95.
N. Alon — V.D. Milman: λ1, isometric inequalities for graphs, and superconcentrators. J. Combinatorial Theory B 38 (1985), 73–88.
T.N. Bui — S. Chanduri — F.T. Leighton — M. Sipser: Graph bisection algorithms with good average case behavior. Combinatorica 7 (1987), 171–191.
A. Broder — E. Shamir: On the second eigenvalue of random regular graphs. In: Proc. 28th Annual Symp. on FOCS, IEEE 1987, 286–294.
Gabber — Z. Galil: Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22 (1981), 407–420.
M.R. Garey — D.S. Johnson: Some simplified NP-complete graph problems, Theor. Comp. Science 1 (1976), 237–267.
D.S. Johnson — C.R. Aragon — L.A. Mc Geoch — C. Schevon: Optimization by simulated annealing: An experimental evaluation (Part I), Preprint, AT + T Bell Labs, Murray Hill, NY (1985).
B.W. Kernighan — S. Lin: An efficient heuristic procedure for partitioning graphs, Bell Systems Techn. J. 49 (1970), 291–307.
A. Lubotzky — R. Phillips — P. Sarnak: Ramanujan graphs. Combinatorica 8 (1988), No. 3, 261–277.
H. Mühlenbein — O. Krämer — G. Peise — R. Rinn: The Megaframe Hypercluster — A reconfigurable architecture for massively parallel computers, IEEE Conference on Computer Architecture, Jerusalem 1989.
D.A. Nicole, Esprit Project 1085, Reconfigurable Transputer Processor Architecture, Proc. CONPAR 88, 12–39.
J. Petersen: Die Theorie der regulären Graphs, Acta Mathematica 15 (1891), 193–220.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hromkovič, J., Monien, B. (1991). The bisection problem for graphs of degree 4 (configuring transputer systems). In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_64
Download citation
DOI: https://doi.org/10.1007/3-540-54345-7_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54345-9
Online ISBN: 978-3-540-47579-8
eBook Packages: Springer Book Archive