Now showing items 1-4 of 4

    • Bisection of random cubic graphs 

      Díaz Cort, Josep; Do, Norman; Serna Iglesias, María José; Wormald, Nick (2002-05)
      External research report
      Open Access
      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. ...
    • Bounds on the bisection width for random d-regular graphs 

      Díaz Cort, Josep; Serna Iglesias, María José; Wormald, Nick (2004-04)
      External research report
      Open Access
      In this paper we provide an explicit way to compute asymptotically almost sure upper bounds on the bisection width of random d-regular graphs, for any value of d. The upper bounds are obtained from the analysis of the ...
    • Bounds on the max and min bisection of random cubic and 4-regular graphs 

      Díaz Cort, Josep; Do, Norman; Serna Iglesias, María José; Wormald, Nick (2002-12)
      External research report
      Open Access
      In this paper we present simple randomized algorithms to bisect cubic and 4-regular graphs. These algorithms produce bisections of size asymptotically at most 0.17404n for typical random cubic n-vertex graphs, and ...
    • Computation of bisection width for random d-regular graphs 

      Díaz Cort, Josep; Serna Iglesias, María José; Wormald, Nick (2003-07)
      External research report
      Open Access
      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 ...