Node importance ranking and scaling properties of some complex road networks

dc.contributor.authorHawick, K.A.
dc.contributor.authorJames, H.A.
dc.date.accessioned2013-05-20T21:50:33Z
dc.date.available2013-05-20T21:50:33Z
dc.date.issued2007
dc.description.abstractThe scaling and other quantifiable properties of a network have recently been proven valuable in understanding the robustness and vulnerability properties of various societal and infrastructural networks. In this paper we revisit the algorithms for computing various quantifiable properties of a planar road network and consider the algorithmic complexity and scalability in the light of recent technological advances. We compute properties for a sample of interesting trunk road networks and discuss their applicability in determining the relative importance or criticality to the whole network of a particular node. We discuss the implications of present and anticipated technological capabilities in calculating properties for anticipated network sizes in the light of 64-bit computer architectures and commodity parallel computing.en
dc.identifier.citationHawick, K.A., James, H.A. (2007), Node importance ranking and scaling properties of some complex road networks, Research Letters in the Information and Mathematical Sciences, 11, 23-32en
dc.identifier.issn1175-2777
dc.identifier.urihttp://hdl.handle.net/10179/4490
dc.language.isoenen
dc.publisherMassey Universityen
dc.subjectCircuitsen
dc.subjectAll-pairs distanceen
dc.subjectNetworksen
dc.subjectComplex systemsen
dc.titleNode importance ranking and scaling properties of some complex road networksen
dc.typeArticleen
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Node_Importance_Ranking_and_Scaling_Properties_of_some_Complex_Road_Networks.pdf
Size:
523.78 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: