https://m2.mtmt.hu/ hun 2026-08-26 01:47 JournalArticle 32454579 VALIDATED true 0 false 2025-03-05T10:47:57.721+0000 2021-10-17T23:35:02.306+0000 2021-10-17T23:34:59.863+0000 true 10067876 Ladányi Gusztáv /api/admin/10067876 Admin true 2022-11-15T17:59:19.085+0000 2021-10-17T23:35:00.551+0000 true 10067876 Ladányi Gusztáv /api/admin/10067876 Admin true false false true 24 24 /api/publicationtype/24 PublicationType 1 true 24 JournalArticle true 10000059 Article true 24 24 /api/publicationtype/24 PublicationType 1 true 24 JournalArticle /api/subtype/10000059 Szakcikk SubType 101 true 10000059 true 1 /api/category/1 Category true 1 Alrasheed, Hend On the Utilization of Shortest Paths in Complex Networks true true /api/journal/10031308 REVIEWED true false 10031308 false 10031308 true 2169-3536 2169-3536 Journal FOREIGN 9 110989 111004 110989 16 2021 Considerable effort has been devoted to the study of network structures and connectivity patterns and their influence on network dynamics. A widely used assumption in network analysis models is that traffic follows the shortest paths connecting pairs of nonneighboring vertices. For example, graph centrality measures, community extraction algorithms, and core-periphery detection algorithms use this assumption. However, this is a very restricted perspective and can be misleading as a consequence of its focus on shortest path communications. In this work, we study the utilization of shortest paths in complex networks in different data dissemination scenarios. We also explore whether there are general properties that can make networks utilize shortest paths more effectively. By conducting simulations on a set of real-world and artificial networks, we show that the utilization of shortest paths in complex networks may not be as common as assumed. This implies that longer paths can be as important (in some cases) as the shortest paths. Our results show that at least two factors clearly influence shortest path utilization in a network: the structure of the network and the data dissemination algorithm. We also find that the type of a network is not a good indicator of its shortest path utilization. 2021 true true true false false GOLD 2025-03-05 false 0 0 0 0 0 0 0 0 0 0 0 0 3 3 Q1 false false false false 4 16 0 1 0 true Language 10002 /api/language/10002 Angol English true 2 true PersonAuthorship 99046545 /api/authorship/99046545 1 1.0 true false true Alrasheed Hend true false false AuthorshipType 1 /api/authorshiptype/1 0 true 0 true false true PublicationIdentifier 20087992 /api/publicationidentifier/20087992 PlainSource 6 /api/publicationsource/6 PublicationSourceType 10001 /api/publicationsourcetype/10001 true true true DOI DOI https://doi.org/@@@ true true 6 true IDENTICAL 10.1109/ACCESS.2021.3101176 https://doi.org/10.1109/ACCESS.2021.3101176 false true PublicationIdentifier 20087991 /api/publicationidentifier/20087991 PlainSource 1 /api/publicationsource/1 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true WoS WoS https://www.webofscience.com/wos/woscc/full-record/@@@ true true 1 true IDENTICAL 000684696700001 https://www.webofscience.com/wos/woscc/full-record/000684696700001 false true PublicationIdentifier 20087993 /api/publicationidentifier/20087993 PlainSource 3 /api/publicationsource/3 PublicationSourceType 10003 /api/publicationsourcetype/10003 false true true Scopus http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@ true true 3 true IDENTICAL 85112665962 http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85112665962 false true Classification 10034 /api/classification/10034 true true Classification 10880 /api/classification/10880 true true Keyword 6461 /api/keyword/6461 true 6461 true Keyword 1016204 /api/keyword/1016204 true 1016204 true Keyword 1016383 /api/keyword/1016383 true 1016383 true Keyword 1130405 /api/keyword/1130405 true 1130405 true Keyword 1167057 /api/keyword/1167057 true 1167057 true Keyword 1171180 /api/keyword/1171180 true 1171180 true Keyword 1187970 /api/keyword/1187970 true 1187970 true Keyword 1411016 /api/keyword/1411016 true 1411016 true Keyword 1589846 /api/keyword/1589846 true true Keyword 1724485 /api/keyword/1724485 true true Keyword 1789848 /api/keyword/1789848 true true Keyword 2524237 /api/keyword/2524237 true true Keyword 2524238 /api/keyword/2524238 true true Keyword 2524239 /api/keyword/2524239 true true Keyword 2524240 /api/keyword/2524240 true true SjrRating 11204011 /api/sjrrating/11204011 55 0.24 journal RatingType 10002 /api/ratingtype/10002 sjr true true ClassificationExternal 1701 /api/classificationexternal/1701 true 1701 true Q1 DIRECT true true /api/publication/32454579 <div class="JournalArticle Publication long-list"> <div class="authors"> <img title="Idézőközlemény" style="float: left" src="/frontend/resources/grid/publication-citation-icon.png"> <div class="autype autype0"> <span class="author-name" >Alrasheed Hend ✉ </span> </div> </div> <div class="title"><a href="/gui2/?mode=browse&params=publication;32454579" target="_blank">On the Utilization of Shortest Paths in Complex Networks</a></div> <div> <span class="journal-title">IEEE ACCESS</span> <span class="journal-issn">(<a target="_blank" href="https://portal.issn.org/resource/ISSN/2169-3536">2169-3536</a> <a target="_blank" href="https://portal.issn.org/resource/ISSN/2169-3536">2169-3536</a>)</span>: <span class="journal-volume">9</span> <span class="page"> pp 110989-111004 </span> <span class="year">(2021)</span> </div> <div class="pub-footer"> <span class="language" xmlns="http://www.w3.org/1999/html">Nyelv: Angol | </span> <span class="identifiers"> <span class="id identifier oa_none" title="none"> <a style="color:blue" title="10.1109/ACCESS.2021.3101176" target="_blank" href="https://doi.org/10.1109/ACCESS.2021.3101176"> DOI </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:blue" title="000684696700001" target="_blank" href="https://www.webofscience.com/wos/woscc/full-record/000684696700001"> WoS </a> </span> <span class="id identifier oa_none" title="none"> <a style="color:blue" title="85112665962" target="_blank" href="http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85112665962"> Scopus </a> </span> </span> <div class="publication-citation"> <a target="_blank" href="/api/publication?cond=citations.related;eq;32454579&sort=publishedYear,desc&sort=title"> Idézett közlemények száma: 3 </a> </div> <div class="mtid"><span class="long-pub-mtid">Közlemény: 32454579</span> | <span class="status-data status-VALIDATED"> Egyeztetett </span> Idéző | <span class="type-subtype">Folyóiratcikk ( Szakcikk ) </span> | <span class="pub-category">Tudományos</span> | <span class="publication-sourceOfData">WoS-XML</span> </div> <div class="lastModified">Utolsó módosítás: 2021.10.18. 01:35 Ladányi Gusztáv (MTMT API user, admin) </div> </div></div>