|
Volumn , Issue , 1999, Pages 399-408
|
Cuts, trees and ℓ-embeddings of graphs (preliminary version)
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
TOPOLOGY;
TREES (MATHEMATICS);
CONSTANT DISTORTION EMBEDDING;
METRIC DISTORTION;
UNDIRECT GRAPH;
GRAPH THEORY;
|
EID: 0033317462
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (40)
|
References (30)
|