Open Access
| Issue |
E3S Web Conf.
Volume 426, 2023
The 5th International Conference of Biospheric Harmony Advanced Research (ICOBAR 2023)
|
|
|---|---|---|
| Article Number | 01024 | |
| Number of page(s) | 6 | |
| Section | Integrated Sustainable Science and Technology Innovation | |
| DOI | https://doi.org/10.1051/e3sconf/202342601024 | |
| Published online | 15 September 2023 | |
- H. Abu-Ryash, A. Tamimi, Comparison Studies for Different Shortest path Algorithms, Int. J. Comp. Appl. 14, 8, 5979-5986 (2015) [Google Scholar]
- I. K. Laga Dwi Pandika, B. Irawan, C. Setianingsih, Application of optimization heavy traffic path with floyd-warshall algorithm, in Proceedings of the International Conference on Control, Electronics, Renewable Energy and Communications, ICCEREC, 5-7 Dec 2018, Bandung, Indonesia (2018) [Google Scholar]
- B. Amaliah, C. Fatichah, O. Riptianingdyah, Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm, Int. J. Smart Sens. Intell. Syst. 9, 4, 2219-2236 (2016) [Google Scholar]
- H. Mahmoud, N. Akkari, Shortest path calculation: a comparative study for location- based recommender system, in in 2016 world symposium on computer applications & research, WSCAR, 12-14 Mar 2016, Cairo, Egypt (2016) [Google Scholar]
- M. Afser, M. U. Shameem, J. Ferdous, M. Milon, M. Hossain, Study on single source shortest path algorithms, Ph.D. dissertation, United International University (2017) [Google Scholar]
- N. Biggs, E. K. Lloyd, R. J. Wilson, Graph theory, Oxford University Press, 1736-1936 (1986) [Google Scholar]
- H. Singh, R. Sharma, Int. J. Comp. Tech. 3, 1, 179-183 (2012) [CrossRef] [Google Scholar]
- X. Yang, Adjacent matrix, https://www.cs.mtsu.edu/~xyang/3080/adjacencyMatrix.html (n.d) [Google Scholar]
- GeeksforGeeks, Graphs and its representations, https://www.geeksforgeeks.org/graph-and-its-representations/ (n.d) [Google Scholar]
- X. Huang, Negative-weight cycle algorithms, in FCS, pp. 109-115 (2006) [Google Scholar]
- G. Melancon, Just how dense are dense graphs in the real world? a methodological note, in Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, AVI06, 23 May 2006, Venice, Italy (2006) [Google Scholar]
- Math.stackexchange, Maximally dense unit distance graphs, https://math.stackexchange.com/questions/2575268/maximally-dense-unit-distance-graphs (2019) [Google Scholar]
- Stackoverflow, Find center of a sparse graph, https://stackoverflow.com/questions/18285998/find-center-of-a-sparse-graph (2013) [Google Scholar]
- R. Risald, A. E. Mirino, S. Suyoto, Best routes selection using Dijkstra and Floyd-Warshall algorithm, in 2017 11th International Conference on Information & Communication Technology and System, ICTS, pp. 155-158 (2017) [Google Scholar]
- M. A. Samosir, Formosa J. Sci. Tech. 2, 2, 453- 474 (2023) [CrossRef] [Google Scholar]
- R. Johner, A. Lanaia, R. Dornberger, T. Hanne, Comparing the Pathfinding Algorithms A, Dijkstra’s, Bellman-Ford, Floyd-Warshall, and Best First Search for the Paparazzi Problem, in Congress on Intelligent Systems: Proceedings of CIS 2021, 2, pp. 561-576 (2022) [Google Scholar]
- T. K. Kim, T test as a parametric statistic Korean, J. Anesthesiol. 68, 6, 540-546 (2015) [Google Scholar]
- T. K. Kim, J. H. Park, More about the basic assumptions of t-test: normality and sample size, Korean J. Anesthesiol, 72, 4, 331-335 (2019) [CrossRef] [PubMed] [Google Scholar]
- P. Mishra, U. Singh, C. M. Pandey, P. Mishra, G. Pandey, Application of Student’s t-test, Analysis of Variance, and Covariance, Anaesth. 22, 4, 407 (2019) [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.