Results 1 to 10 of about 218,121 (185)
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 +2 more sources
Shortest paths between shortest paths and independent sets [PDF]
, 2010 We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know ...
Kaminski, Marcin +2 more
core +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 +2 more sources
Reconfiguring Shortest Paths in Graphs. [PDF]
Algorithmica, 2022 AbstractReconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the ...
Gajjar K, Jha AV, Kumar M, Lahiri A.
europepmc +4 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
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
An FPTAS for Dynamic Multiobjective Shortest Path Problems
Algorithms, 2021 The Dynamic Multiobjective Shortest Path problem features multidimensional costs that can depend on several variables and not only on time; this setting is motivated by flight planning applications and the routing of electric vehicles.
Pedro Maristany de las Casas +3 more
doaj +1 more source
top-k Path Greedy Generalization Algorithm of Anonymity Shortest Path [PDF]
Jisuanji gongcheng, 2016 With the development of social networks,the issues of privacy preservation arouse extensive attention.It can cause privacy disclosure of the shortest path if weighted social network data are protected before its publication.In order to solve this issue ...
CHEN Weihe,DING Leilei
doaj +1 more source