Results 1 to 10 of about 1,848,326 (324)
Shortest Paths in Multiplex Networks [PDF]
Scientific Reports, 2017 The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in ...
Saeed Ghariblou +3 more
doaj +3 more sources
Two betweenness centrality measures based on Randomized Shortest Paths. [PDF]
Sci Rep, 2016 This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods ...
Kivimäki I +3 more
europepmc +4 more sources
Improved Distributed Algorithms for Exact Shortest Paths [PDF]
Symposium on the Theory of Computing, 2018 Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +2 more sources
Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation [PDF]
Scientific Reports, 2023 Betweenness centrality is one of the key measures of the node importance in a network. However, it is computationally intractable to calculate the exact betweenness centrality of nodes in large-scale networks.
Nan Xiang, Qilin Wang, Mingwei You
doaj +2 more sources
A Faster Distributed Single-Source Shortest Paths Algorithm [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing.
Forster, Sebastian, Nanongkai, Danupon
core +2 more sources
Faster all-pairs shortest paths via circuit complexity [PDF]
Symposium on the Theory of Computing, 2014 We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two $n \times n$ matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense $n$-node directed graphs with ...
Aho Alfred V. +3 more
core +2 more sources
Shortest Paths in Graphs of Convex Sets [PDF]
SIAM Journal on Optimization, 2021 Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex.
Tobia Marcucci +3 more
semanticscholar +1 more source
On the Utilization of Shortest Paths in Complex Networks
IEEE Access, 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 ...
Hend Alrasheed
doaj +1 more source
Shortest paths in one-counter systems [PDF]
Logical Methods in Computer Science, 2019 We show that any one-counter automaton with $n$ states, if its language is non-empty, accepts some word of length at most $O(n^2)$. This closes the gap between the previously known upper bound of $O(n^3)$ and lower bound of $\Omega(n^2)$. More generally,
Dmitry Chistikov +4 more
doaj +1 more source
On the Maximal Shortest Paths Cover Number
Mathematics, 2021 A shortest path P of a graph G is maximal if P is not contained as a subpath in any other shortest path. A set S⊆V(G) is a maximal shortest paths cover if every maximal shortest path of G contains a vertex of S.
Iztok Peterin, Gabriel Semanišin
doaj +1 more source