Exploració per tema "Bisection width"

Ara es mostren els items 1-2 de 2

    • Bisection of random cubic graphs 

      Díaz Cort, Josep; Do, Norman; Serna Iglesias, María José; Wormald, Nick (2002-05)
      Report de recerca
      Accés obert
      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. ...

    • Computation of bisection width for random d-regular graphs 

      Díaz Cort, Josep; Serna Iglesias, María José; Wormald, Nick (2003-07)
      Report de recerca
      Accés obert
      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 ...