Cart (Loading....) | Create Account
Close category search window
 

Arc-disjoint paths in expander digraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bohman, T. ; Dept. of Math. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Frieze, A.

Given a digraph D=(V, A) and a set of κ pairs of vertices in V, we are interested in finding for each pair (xi, yi), a directed path connecting xi to yi, such that the set of κ paths so found is arc-disjoint. For arbitrary graphs, the problem is 𝒩𝒫-complete, even for κ=2. We present a polynomial time randomized algorithm for finding arc-disjoint paths in an r-regular expander digraph D. We show that if D has sufficiently strong expansion properties and r is sufficiently large, then all sets of κ=Ω(n/log n) pairs of vertices can be joined. This is within a constant factor of best possible.

Published in:

Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on

Date of Conference:

8-11 Oct. 2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.