Graph Theory and Road Redesign

Paper Summary:

This paper explains that graphs allow for a simplification of the real world, doing away with extraneous details without sacrificing any information necessary for the task. The author points out that graph theory is the best tool to use to solve the problem of road conversion because it is the most parsimonious. The assumptions made by graph theory more closely than any other model or theory match the real-world conditions. The paper states that, in converting roads, the effect in the real world will be a disruption of what had been the shortest paths between different points, and urban planners will include some consideration of shortest path issues. Tables and figures.

Table of Contents
Introduction
Graph Theory as the Basis for Conversion of Two-Way Roads
Undirected Graphs to Digraphs
Reachability Problem
Shortest Path Problem
Importance of Simulation
Comment on Validity of Data
Conclusion

From the Paper:

"The specific shortest path method that is most useful in this particular type of problem is Pallottino's graph growth algorithm with two queues. It must be emphasized that the determination of the shortest path algorithms is perhaps the most important component of any network analysis. It is also quite often the first step in any network analysis as the determination of the shortest path is often needed as a key datum in making later choices."

More papers on Graph Theory and Road Redesign:

• Research Paper # 31537 : "The Staple Theory and Canada's Economy"
• Term Paper # 121507 : "Management Theory and Practice"
• Essay # 32500 : "Rational Choice Theory and Post-Modernism"

APA Citation:

MLA Citation: