All Pairs Shortest Path Algorithms

dc.contributor.author	Cook, David Jonathan
dc.date.accessioned	2015-10-16T01:49:35Z
dc.date.available	2015-10-16T01:49:35Z
dc.date.issued	1999	en
dc.description.abstract	There are many algorithms for the all pairs shortest path problem, depending on variations of the problem. The simplest version takes only the size of vertex set as a parameter. As additional parameters, other problems specify the number of edges and/ or the maximum value of edge costs. In this report, we focus on the edge costs. Specifically, we identify the distribution of edge costs. If the spectrum of edge costs distributes around two values, we can speed up the processing time. This is typical in road networks, where we have big distances between main centres, and small distances within the centre cities.	en
dc.identifier.uri	http://hdl.handle.net/10092/11197
dc.language.iso	en
dc.publisher	University of Canterbury. Mathematics and Statistics	en
dc.relation.isreferencedby	NZCU	en
dc.rights	Copyright David Jonathan Cook,	en
dc.rights.uri	https://canterbury.libguides.com/rights/theses	en
dc.subject.anzsrc	Field of Research::01 - Mathematical Sciences	en
dc.title	All Pairs Shortest Path Algorithms	en
dc.type	Discussion / Working Papers
thesis.degree.grantor	University of Canterbury	en
thesis.degree.level	Bachelors with Honours	en
thesis.degree.name	Bachelor of Science with Honours	en
uc.college	Faculty of Engineering	en

Now showing 1 - 1 of 1