A single-exponential upper bound for finding shortest paths in three dimensions

Journal article

A single-exponential upper bound for finding shortest paths in three dimensions

John H Reif and James A Storer

Journal of the ACM, Vol.41(5), pp.1013-1019

09/1994

DOI: https://doi.org/10.1145/185675.185811

Metrics

32 Record Views

Details

Title: A single-exponential upper bound for finding shortest paths in three dimensions
Creators: John H Reif - Duke Univ., Durham, NC
James A Storer - Brandeis Univ., Waltham, MA
Publication Details: Journal of the ACM, Vol.41(5), pp.1013-1019
Identifiers: 9923958474901921
Academic Unit: Michtom School of Computer Science; Benjamin and Mae Volen National Center for Complex Systems
Language: English
Resource Type: Journal article