"A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)"

Peter A. Bloniarz (1980)

Details and statistics

DOI: 10.1145/800141.804687

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics