"Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?"

Camil Demetrescu et al. (2006)

Details and statistics

DOI: 10.1007/11841036_65

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics