Title:
|
Computation of bisection width for random d-regular graphs
|
Author:
|
Díaz Cort, Josep; Serna Iglesias, María José; Wormald, Nick
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
Abstract:
|
In this paper we describe a randomized greedy algorithm for obtaining
bisections of graphs. Analysis of the algorithm's performance on random
d-regular graphs yields asymptotically almost sure upper bounds on the
bisection width of such graphs with
n vertices, as n goes to infinity. We also give empirical values of the
size of
bisection found by the algorithm for some small values of d. |
Subject(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Randomized greedy algorithm -Graphs bisections -Bisection width -Random d-regular graphs |
Rights:
|
|
Document type:
|
Article - Published version Report |
Share:
|
|