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[...]
A new supply chain perspective: The supply chain life cycle
It is not often that I come across papers with a holistic view of the supply chain as a living and d[...]
BOOKS and BOOK CHAPTERS
Book review: Cost-Benefit Analysis: Theory and Application
I really enjoyed reading Cost-Benefit Analysis: Theory and Application by Tefvik Nas.  I used this b[...]
Book Review: Logistics Management and Strategy
Logistics Management and Strategy by Alan Harrison and Remko van Hoek does come at very hefty price,[...]
REPORTS and WHITEPAPERS
Global Risks 2008 - A prediction come true
In my post on Hyper-optimization and supply chain vulnerability: an invisible global risk? I highlig[...]
A Decade of Living Dangerously
Do you remember the movie The Year of Living Dangerously with Mel Gibson? Topically unrelated maybe,[...]