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
Accessibility Index - Transport Network Vulnerability
Taylor, M., Sekhar, S., & D'Este, G. (2006). Application of Accessibility Based Methods for Vulnerability Analysis of Strategic Road Networks Networks and Spatial Economics, 6 (3-4), 267-291
I had the pleasure of meeting M.A.P. Taylor at the 3rd International Symposium on Transport Network [...]
Graph Theory to the rescue
Graph Theory. In Supply Chain Management? It's probably 10 years ago since last time I looked at Gra[...]
BOOKS and BOOK CHAPTERS
Book Review: Supply Chain Risk Management
This excellent book by Donald Waters, Supply Chain Risk Management: Vulnerability and Resilience in [...]
Book Review: Managing Risk and Resilience in the Supply Chain
This book is a gem. To me. Where Helen Peck in her article Reconciling supply chain vulnerability, r[...]
REPORTS and WHITEPAPERS
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 [...]
Zycus and the Supply Risk Explosion
"Ten or fifteen years ago, you could not convince most procurement and supply-chain professionals to[...]