Home › my PUBLIC PRESENCE › Shortest Path Computation: A Comparative Analysis

Shortest Path Computation: A Comparative Analysis

Posted on by
Revised on: 2011-07-22

Current research work into establishing a performance efficiency hierarchy between Java, C++ and ArcView is described and experimentation is performed in order to statistically compare shortest path query execution time, response time and implementation issues.

GISRUK 2002

This is co-authored paper presented at GISRUK 2002, University of Sheffield, Sheffield, UK, 3-5 April 2002

Read online

Read online scribd

Reference

Sherlock, R., Moone, P.,  and Winstanley, A. (2002) Shortest Path Computation: A Comparative Analysis. Paper presented at GISRUK 2002, University of Sheffield, Sheffield, UK, 3-5 April 2002

Posted in my PUBLIC PRESENCE
Tags: , , , , , , , ,
ARTICLES and PAPERS
Biting the hand that feeds. All firms are snakes.
'All firms are snakes'. So says Paul D. Cousins in A conceptual model for managing long-term inter-o[...]
Contingent flexibility
Can contingency planning increase flexibility and minimize risk exposure to supply chain disruptions[...]
BOOKS and BOOK CHAPTERS
Book Review: Security Risk Management - Body of Knowledge
A Wiley book rarely lets you down, and this one doesn't either. With a refreshing Australian touch, [...]
Book Review: Transportation Security
Instead of Transportation Systems Security, which I reviewed in an earlier post, I should have settl[...]
REPORTS and WHITEPAPERS
A Decade of Living Dangerously
Do you remember the movie The Year of Living Dangerously with Mel Gibson? Topically unrelated maybe,[...]
The Benefits of Investing in Supply Chain Security
With the memory of attacks by Somali pirates still fresh in mind, supply chain security has come to [...]