Welcome to the InfoSci Platform
Shortest Path in Transportation Network and Weighted Subdivisions

Shortest Path in Transportation Network and Weighted Subdivisions

Radwa Elshawi, Joachim Gudmundsson
Copyright: © 2012 |Pages: 12
ISBN13: 9781613500538|ISBN10: 161350053X|EISBN13: 9781613500545
DOI: 10.4018/978-1-61350-053-8.ch020
Cite Chapter Cite Chapter

MLA

Elshawi, Radwa, and Joachim Gudmundsson. "Shortest Path in Transportation Network and Weighted Subdivisions." Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, IGI Global, 2012, pp. 463-474. https://doi.org/10.4018/978-1-61350-053-8.ch020

APA

Elshawi, R. & Gudmundsson, J. (2012). Shortest Path in Transportation Network and Weighted Subdivisions. In S. Sakr & E. Pardede (Eds.), Graph Data Management: Techniques and Applications (pp. 463-474). IGI Global. https://doi.org/10.4018/978-1-61350-053-8.ch020

Chicago

Elshawi, Radwa, and Joachim Gudmundsson. "Shortest Path in Transportation Network and Weighted Subdivisions." In Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, 463-474. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-053-8.ch020

Export Reference

Mendeley
Favorite

Abstract

In this chapter we consider two versions of the problem; the shortest path in a transportation network and the shortest path in a weighted subdivision, sometimes called a terrain.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.