Loading…
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm
Saved in:
Published in: | Computational optimization and applications 1993-06, Vol.2 (1), p.47-75 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | |
---|---|
ISSN: | 0926-6003 1573-2894 |
DOI: | 10.1007/BF01299142 |