Edge-disjoint paths in expander graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 717-725

  Frieze, Alan M ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; RANDOM PROCESSES;

EDGE DISJOINT PATHS; EXPANDER GRAPHS; POLYNOMIAL TIME RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0033895878     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (0)