Hostname: page-component-7f64f4797f-bnl7t Total loading time: 0 Render date: 2025-11-03T21:59:56.332Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs

Published online by Cambridge University Press:  01 May 2000

ALAN M. FRIEZE  and
LEI ZHAO
ALAN M. FRIEZE
Affiliation:
Department of Mathematical Sciences, Carnegie-Mellon University, Pittsburgh, PA 15213, USA (e-mail: alan@random.math.cmu.edu, lzhao@andrew.cmu.edu)
LEI ZHAO
Affiliation:
Department of Mathematical Sciences, Carnegie-Mellon University, Pittsburgh, PA 15213, USA (e-mail: alan@random.math.cmu.edu, lzhao@andrew.cmu.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

Given a graph G = (V, E) and a set of κ pairs of vertices in V, we are interested in finding, for each pair (ai, bi), a path connecting ai to bi such that the set of κ paths so found is edge-disjoint. (For arbitrary graphs the problem is [Nscr][Pscr]-complete, although it is in [Pscr] if κ is fixed.)

We present a polynomial time randomized algorithm for finding edge-disjoint paths in the random regular graph Gn,r, for sufficiently large r. (The graph is chosen first, then an adversary chooses the pairs of end-points.) We show that almost every Gn,r is such that all sets of κ = Ω(n/log n) pairs of vertices can be joined. This is within a constant factor of the optimum.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 9 , Issue 3 , May 2000 , pp. 241 - 263
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable