Results 11 to 20 of about 218,626 (238)
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 +4 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
Finding next-to-shortest paths in a graph [PDF]
Information Processing Letters, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
I Krasikov, Steven D Noble
exaly +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
CoRR, 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.
Löffler, M. +3 more
openaire +8 more sources
The College Mathematics Journal, 2021 35 pages, including 3 appendices and program ...
Richard Goldstone +2 more
openaire +2 more sources
Shortest paths with ordinal weights [PDF]
European Journal of Operational Research, 2020 24 pages, 8 figures, 2 ...
Luca E. Schäfer +4 more
openaire +3 more sources
Shortest paths between shortest paths
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Kaminski 0001 +2 more
openaire +2 more sources
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler +2 more
openaire +1 more source