Results 1 to 10 of about 32,209 (302)
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 +5 more sources
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 +4 more sources
Journal of Computational Geometry, 2023 Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric ...
Tim Ophelders +3 more
doaj +9 more sources
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
SIAM Journal on Computing, 1998 Summary: We give algorithms for finding the \(k\) shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with \(n\) vertices and \(m\) edges, in time \(O(m+n\log n+k)\). We can also find the \(k\) shortest paths from a given source \(s\) to each
David Eppstein
exaly +3 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
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
The College Mathematics Journal, 2021 35 pages, including 3 appendices and program ...
Richard Goldstone +2 more
openaire +2 more sources