Have a personal or library account? Click to login
Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm Cover

Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm

International Journal on Smart Sensing and Intelligent Systems
Volume 9 (2016): Issue 4 (January 2016)
By: Bilqis Amaliah,  Chastine Fatichah and  Olyn Riptianingdyah  
Open Access
|Dec 2016

Authors

Bilqis Amaliah

bilqis@if.its.ac.id

Informatics Engineering, Faculty of Information Technology, Institut Teknologi Sepuluh Nopember Jl. Raya ITS, Gedung Teknik Informatika, Surabaya, Indonesia

Chastine Fatichah

chastine@cs.its.ac.id

Informatics Engineering, Faculty of Information Technology, Institut Teknologi Sepuluh Nopember Jl. Raya ITS, Gedung Teknik Informatika, Surabaya, Indonesia

Olyn Riptianingdyah

Informatics Engineering, Faculty of Information Technology, Institut Teknologi Sepuluh Nopember Jl. Raya ITS, Gedung Teknik Informatika, Surabaya, Indonesia
DOI: https://doi.org/10.21307/ijssis-2017-961 | Journal eISSN: 1178-5608
Journal RSS Feed
Language: English
Page range: 2219 - 2236
Submitted on: Aug 16, 2016
|
Accepted on: Nov 14, 2016
|
Published on: Dec 1, 2016
Published by: Professor Subhas Chandra Mukhopadhyay
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
Shortest path problem,
Dijkstra algorithm,
Node combination,
Transportation problem
Related subjects:
Engineering,
Introductions and overviews,
Engineering, other

© 2016 Bilqis Amaliah, Chastine Fatichah, Olyn Riptianingdyah, published by Professor Subhas Chandra Mukhopadhyay
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 9 (2016): Issue 4 (January 2016)Next article