Selected papers that cite this one
- Takao Asano. An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees. Journal of Computer and System Sciences, 51(3):503-510, December 1995.
- John H. Reif and James A. Storer. A single-exponential upper bounds for finding shortest paths in three dimensions. Journal of the ACM, 41(5):1013-1019, September 1994.