z-logo
open-access-imgOpen Access
Development of Shortest Path Searching Network Reduction Algorithm
Author(s) -
Yeong-Geun Ryu
Publication year - 2013
Publication title -
the journal of the korea institute of intelligent transport systems
Language(s) - English
Resource type - Journals
eISSN - 2092-1500
pISSN - 1738-0774
DOI - 10.12815/kits.2013.12.2.012
Subject(s) - shortest path problem , node (physics) , yen's algorithm , k shortest path routing , path (computing) , algorithm , shortest path faster algorithm , average path length , line (geometry) , reduction (mathematics) , constrained shortest path first , mathematics , computer science , longest path problem , euclidean shortest path , dijkstra's algorithm , combinatorics , computer network , graph , engineering , geometry , structural engineering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom