Bisection of random cubic graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97498

Title:	Bisection of random cubic graphs
Author:	Díaz Cort, Josep; Do, Norman; 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 present two randomized algorithms to compute the bisection width of random cubic graphs with n vertices, giving an asymptotic upper bound for the bisection width respectively of 0.174039n and 0.174501n. We also obtain an asymptotic lower bound for the size of the max bisection of a random cubic graph with n vertices of 1.325961n and 1.325499n. The analysis is based on the differential equation method.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica -Random cubic graphs -Randomized algorithms -Bisection width
Rights:
Document type:	Article - Published version Report
Share: