FAST PURSUIT OF MOBILE NODES USING TPR TREES

DOI10.1142/S012905410400273XzbMath1103.68133OpenAlexW1966368501MaRDI QIDQ4667923

Mario A. Lopez, Sahar Idwan, Dinesh P. Mehta

Publication date: 18 April 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410400273x

zbMATH Keywords

time parameterized R-tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Dog Bites Postman
• Unnamed Item

This page was built for publication: FAST PURSUIT OF MOBILE NODES USING TPR TREES