Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal  Home/Search
Context Related
| siam.org/sambin/getfile/S...29080.ps.Z From: siam.org/sambin/dbq/arti...29080 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: .<F3.823e+05> Given a graph<F3.498e+05> G<F3.823e+05> =<F3.498e+05> (V,<F3.823e+05> E) with<F3.498e+05> n<F3.823e+05> vertices,<F3.498e+05> m<F3.823e+05> edges, and a family of<F3.498e+05> #<F3.823e+05> pairs of vertices in<F3.498e+05> V<F3.823e+05> , we are interested in finding for each pair<F3.498e+05> (a<F3.28e+05> i<F3.498e+05> , b<F3.28e+05> i<F3.823e+05> ) a path connecting<F3.498e+05> a<F3.28e+05> i<F3.823e+05> to<F3.498e+05> b<F3.28e+05> i<F3.823e+05> such that the set of<F3.498e+05>... (Update)
Context of citations to this paper: More
...without using any globally known server. Interesting properties and algorithms have been discovered for random regular graphs [5] [6], 7] 8] In particular, it has been found that random regular graphs are expected to have big eigenvalue gaps [9] with high...
...each edge. A different approach is taken in papers of Peleg and Upfal [19] and Broder, Frieze, and Upfal [7] see also Broder et al. [6]) Here the underlying graph G is assumed to have strong expansion properties; in this case one can prove that any set of terminal pairs of...
Cited by: More
Disjoint Paths in Densely Embedded Graphs - Jon Kleinberg Eva (Correct)
Approximations for the Disjoint Paths Problem in.. - Kleinberg, Tardos (1995) (Correct)
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (Correct)
Similar documents (at the sentence level):
27.8%: Optimal Construction of Edge-Disjoint Paths in Random Graphs - Broder, Frieze, Suen, Upfal (1994) (Correct)
7.7%: Optimal Construction of Edge-Disjoint Paths in Random Regular.. - Frieze, Zhao (1994) (Correct)
Active bibliography (related documents): More All
0.5: On The Quality Of Spectral Separators - Guattery, Miller (1998) (Correct)
0.5: Threshold Phenomena in Random Graph Colouring and Satisfiability - Achlioptas (1999) (Correct)
0.3: The Queue-Read Queue-Write PRAM Model: Accounting for.. - Gibbons, Matias.. (1994) (Correct)
Similar documents based on text: More All
0.8: Edge-Disjoint Paths in Expander Graphs - Frieze (2000) (Correct)
0.7: Splitting an Expander Graph - Frieze, Molloy (Correct)
0.5: Arc-Disjoint Paths in Expander Digraphs - Tom Bohman And (2001) (Correct)
Related documents from co-citation: More All
13: Existence and construction of edge-disjoint paths on expander graphs (context) - Broder, Frieze et al. - 1994
9: Graph Minors XIII. The disjoint paths problem (context) - Robertson, Seymour - 1995
8: Multicommodity flows in planar graphs (context) - Okamura, Seymour - 1981
BibTeX entry: (Update)
A. Broder, A. Frieze, S. Suen, E. Upfal, "Optimal construction of edge-disjoint paths in random graphs," Proc. 5th ACM-SIAM SODA, 1994, pp. 603--612. http://citeseer.ist.psu.edu/article/broder98optimal.html More
@inproceedings{ broder94optimal,
author = "Broder and Frieze and Suen and Upfal",
title = "Optimal Construction of Edge-Disjoint Paths in Random Graphs",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1994",
url = "citeseer.ist.psu.edu/article/broder98optimal.html" }
Citations (may not include all citations):42 A probabilistic proof of an asymptotic formula for the numbe.. (context) - Bollob, as - 1980
37 Approximations for the disjoint paths problem in high-diamet.. - Kleinberg, Tardos - 1995
34 The asymptotic number of labelled graphs with given degree<F (context) - Bender, Canfield - 1978
34 Existence and construction of edge-disjoint paths on expande.. (context) - Broder, Frieze et al. - 1994
9 Hamilton cycles in random graphs with minimal degree at leas.. (context) - as, Fenner et al. - 1990
3 An exact sublinear algorithm for the max flow (context) - Hochbaum - 1992
3 Graph Theory with<F (context) - Bondy, Murty - 1976
2 cient algorithm for the vertexdisjoint paths problem in rand.. (context) - Broder, Frieze et al. - 1996
2 uniform generation and rapidly mixing Markov<F (context) - Sinclair, Jerrum et al. - 1989
1 A theorem on flows in<F (context) - Gale - 1957
1 the method of bounded<F (context) - McDiarmid, On - 1989
1 chromatic hypergraphs and some related<F (context) - os, Lov et al. - 1975
1 The token distribution<F (context) - Peleg, Upfal - 1989
1 the second eigenvalue in random regular<F (context) - Friedman, Kahn et al. - 1989
1 minors-XIII: The disjoint paths<F (context) - Robertson, Seymour et al. - 1995
1 A fast construction of disjoint paths in<F (context) - Shamir, Upfal - 1985
1 isoperimetric inequalities and random<F (context) - Bollob, as et al. - 1987
1 Universal schemes for parallel<F (context) - Valiant, Brebner - 1981
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC