Fast algorithms for constructing t-spanners and paths with stretch t

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 648-658

  Cohen, Edith ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES;

DETERMINISTIC ALGORITHMS; GRAPH SPANNING; MINIMUM WEIGHT PATHS; PARALLEL ALGORITHMS; RANDOMIZED ALGORITHMS; SHORTEST PATHS; WEIGHTED GRAPHS;

ALGORITHMS;

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

References (10)