|
Volumn 2380 LNCS, Issue , 2002, Pages 985-992
|
Finding a path of superlogarithmic length
|
Author keywords
[No Author keywords available]
|
Indexed keywords
AUTOMATA THEORY;
GRAPH'S VERTICES;
LONGEST PATH PROBLEMS;
PERFORMANCE RATIO;
POLYNOMIAL-TIME ALGORITHMS;
POLYNOMIAL APPROXIMATION;
|
EID: 1842539952
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-45465-9_84 Document Type: Conference Paper |
Times cited : (3)
|
References (9)
|