{"id":"https://openalex.org/W4318196244","doi":"https://doi.org/10.3233/faia220500","title":"Analysis of the Shortest Path Method Application in Social Networks","display_name":"Analysis of the Shortest Path Method Application in Social Networks","publication_year":2023,"publication_date":"2023-01-23","ids":{"openalex":"https://openalex.org/W4318196244","doi":"https://doi.org/10.3233/faia220500"},"language":"en","primary_location":{"id":"doi:10.3233/faia220500","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia220500","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA220500","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA220500","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033308008","display_name":"Bo\u0161tjan \u0160umak","orcid":"https://orcid.org/0000-0001-5535-3477"},"institutions":[{"id":"https://openalex.org/I37696226","display_name":"University of Maribor","ror":"https://ror.org/01d5jce07","country_code":"SI","type":"education","lineage":["https://openalex.org/I37696226"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Bo\u0161tjan \u0160umak","raw_affiliation_strings":["University of Maribor, Faculty of Electrical Engineering and Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maribor, Faculty of Electrical Engineering and Computer Science","institution_ids":["https://openalex.org/I37696226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082256802","display_name":"Maja Pu\u0161nik","orcid":"https://orcid.org/0000-0003-0087-1044"},"institutions":[{"id":"https://openalex.org/I37696226","display_name":"University of Maribor","ror":"https://ror.org/01d5jce07","country_code":"SI","type":"education","lineage":["https://openalex.org/I37696226"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Maja Pu\u0161nik","raw_affiliation_strings":["University of Maribor, Faculty of Electrical Engineering and Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maribor, Faculty of Electrical Engineering and Computer Science","institution_ids":["https://openalex.org/I37696226"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I37696226"],"apc_list":null,"apc_paid":null,"fwci":1.7975,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.82720819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.940500020980835,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.940500020980835,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8787297010421753},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.860786497592926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6695376634597778},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5401971936225891},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5351273417472839},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5079532265663147},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.42118585109710693},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.41722768545150757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4027765393257141},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30129361152648926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19751077890396118},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09936603903770447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0849202573299408}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8787297010421753},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.860786497592926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6695376634597778},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5401971936225891},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5351273417472839},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5079532265663147},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.42118585109710693},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.41722768545150757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4027765393257141},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30129361152648926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19751077890396118},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09936603903770447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0849202573299408},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/faia220500","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia220500","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA220500","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"pmh:oai:d.cobiss.net/repository/si:139872259","is_oa":false,"landing_page_url":"https://plus.cobiss.net/cobiss/si/en/bib/139872259","pdf_url":null,"source":{"id":"https://openalex.org/S7407055177","display_name":"dCOBISS.SI Digital Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"COBISS-ID: 139866371","raw_type":"info:eu-repo/semantics/bookPart"}],"best_oa_location":{"id":"doi:10.3233/faia220500","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia220500","pdf_url":"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA220500","source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G749772546","display_name":"Information systems","funder_award_id":"P2-0057","funder_id":"https://openalex.org/F4320322554","funder_display_name":"Javna Agencija za Raziskovalno Dejavnost RS"}],"funders":[{"id":"https://openalex.org/F4320322554","display_name":"Javna Agencija za Raziskovalno Dejavnost RS","ror":"https://ror.org/059bp8k51"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4318196244.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W104429441","https://openalex.org/W1997822129","https://openalex.org/W2022193399","https://openalex.org/W2058044254","https://openalex.org/W2070097815","https://openalex.org/W2102709459","https://openalex.org/W2112615110","https://openalex.org/W2148380090","https://openalex.org/W2172548555","https://openalex.org/W2313366933","https://openalex.org/W2343097214","https://openalex.org/W2398424124","https://openalex.org/W2594114561","https://openalex.org/W2744288962","https://openalex.org/W2902252979","https://openalex.org/W2909085420","https://openalex.org/W2939183488","https://openalex.org/W2963252889","https://openalex.org/W2965094071","https://openalex.org/W2999214372","https://openalex.org/W4246219036","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2383519316","https://openalex.org/W2810620529","https://openalex.org/W1562631103","https://openalex.org/W4223969905","https://openalex.org/W2377950158","https://openalex.org/W2348177054","https://openalex.org/W2363342665","https://openalex.org/W4253588386","https://openalex.org/W2886722595","https://openalex.org/W78690942"],"abstract_inverted_index":{"This":[0],"paper":[1,28],"analyzes":[2],"the":[3,13,27,32,39,52,59,62,68,105,116],"shortest":[4,40,117],"path":[5,41],"problem":[6],"(SPP)":[7],"in":[8,42,119],"social":[9,44,97,120],"networks,":[10],"based":[11,88],"on":[12,20,58,89,95],"investigation":[14,80],"and":[15,70,92,110],"implementation":[16,91],"of":[17,26,31,54,61,85],"different":[18,86],"methods":[19,36],"a":[21,43,47,96],"simulated":[22],"example.":[23,99],"The":[24,100],"objectives":[25],"include":[29],"identification":[30],"most":[33,64],"commonly":[34],"used":[35,65,77],"for":[37,82,114],"finding":[38],"network":[45,55,98],"as":[46,78],"strategic":[48],"attempt":[49],"to":[50],"speed":[51],"search":[53],"nodes,":[56],"focusing":[57],"application":[60],"two":[63],"SPP":[66],"methods:":[67],"Dijkstra":[69,106],"Bellman-Ford":[71],"algorithms.":[72],"A":[73],"comparative":[74],"analysis":[75],"is":[76,108],"an":[79],"method":[81],"performance":[83],"evaluation":[84],"algorithms,":[87],"their":[90],"behavior,":[93],"tested":[94],"research":[101],"results":[102],"indicate":[103],"that":[104],"algorithm":[107],"faster,":[109],"therefore":[111],"more":[112],"suitable":[113],"searching":[115],"connection":[118],"networks.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-13T07:31:44.756512","created_date":"2025-10-10T00:00:00"}