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
Supply chain agility - Risk mitigation and response
How does company culture shape a firm's risk mitigation and response, and thus, how does company cul[...]
Drivers of supply chain vulnerability
In 2005, the topic of supply chain vulnerability was still a relatively unexplored territory, though[...]
BOOKS and BOOK CHAPTERS
Book Review: Risk Modeling, Assessment, and Management
First published in 1998 and now already in its 3rd edition in 2009, but still unknown to me, althoug[...]
Is Dynamic Supply Chain Alignment the way of the future?
Dynamic Supply Chain Alignment. That is the magic formula that runs like a red thread through John G[...]
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[...]
Supply Chain and Transport Risk
In our interconnected world, safety, reliability and efficiency can only be secured through collabor[...]