O(1) query time algorithm for all pairs shortest distances on permutation graphs

Alan P. Sprague. O(1) query time algorithm for all pairs shortest distances on permutation graphs. Discrete Applied Mathematics, 155(3):365-373, 2007. [doi]

Abstract

Abstract is missing.