{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T20:53:40Z","timestamp":1777064020521,"version":"3.51.4"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643683706","type":"print"},{"value":"9781643683713","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T00:00:00Z","timestamp":1674432000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,1,23]]},"abstract":"<jats:p>This paper analyzes the shortest path problem (SPP) in social networks, based on the investigation and implementation of different methods on a simulated example. The objectives of the paper include identification of the most commonly used methods for finding the shortest path in a social network as a strategic attempt to speed the search of network nodes, focusing on the application of the two most used SPP methods: the Dijkstra and Bellman-Ford algorithms. A comparative analysis is used as an investigation method for performance evaluation of different algorithms, based on their implementation and behavior, tested on a social network example. The research results indicate that the Dijkstra algorithm is faster, and therefore more suitable for searching the shortest connection in social networks.<\/jats:p>","DOI":"10.3233\/faia220500","type":"book-chapter","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T13:56:18Z","timestamp":1674741378000},"source":"Crossref","is-referenced-by-count":1,"title":["Analysis of the Shortest Path Method Application in Social Networks"],"prefix":"10.3233","author":[{"given":"Bo\u0161tjan","family":"\u0160umak","sequence":"first","affiliation":[{"name":"University of Maribor, Faculty of Electrical Engineering and Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maja","family":"Pu\u0161nik","sequence":"additional","affiliation":[{"name":"University of Maribor, Faculty of Electrical Engineering and Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Information Modelling and Knowledge Bases XXXIV"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA220500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T13:56:19Z","timestamp":1674741379000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA220500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,23]]},"ISBN":["9781643683706","9781643683713"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia220500","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,23]]}}}