|
Volumn , Issue , 1993, Pages 291-300
|
Faster algorithms for some geometric graph problems in higher dimensions
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
CRITICAL PATH ANALYSIS;
ESTIMATION;
GEOMETRY;
OPTIMIZATION;
TREES (MATHEMATICS);
EUCLIDEAN MINIMUM SPANNING TREE;
GEOMETRIC GRAPH PROBLEMS;
GRAPH THEORY;
|
EID: 0027147121
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (121)
|
References (13)
|