Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

Voted

CPC
2000

89views more CPC 2000»

Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs

15 years 2 months ago

Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs

Download www.math.cmu.edu

Alan M. Frieze, Lei Zhao

Real-time Traffic

CPC 2000 |

claim paper

Related Content

» Existence and Construction of Edge Disjoint Paths on Expander Graphs

» Large kSeparated Matchings of Random Regular Graphs

» Network Connectivity via Inference over CurvatureRegularizing Line Graphs

» A nearly optimal oracle for avoiding failed vertices and edges

» Randomized Decoding for SelectionandOrdering Problems

» Inter and Intramodal Deformable Registration Continuous Deformations Meet Efficient Optima...

» Oblivious routing on geometric networks

» Hardness of routing with congestion in directed graphs

» Distance Oracles for Sparse Graphs

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CPC
Authors	Alan M. Frieze, Lei Zhao

Comments (0)