|
Volumn 293, Issue 3, 2003, Pages 535-556
|
Improved shortest path algorithms for nearly acyclic graphs
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
DATA STRUCTURES;
PROBLEM SOLVING;
TREES (MATHEMATICS);
ACYCLIC GRAPHS;
COMPUTER SCIENCE;
|
EID: 0037427178
PISSN: 03043975
EISSN: None
Source Type: Journal
DOI: 10.1016/S0304-3975(02)00613-8 Document Type: Conference Paper |
Times cited : (7)
|
References (10)
|