Results 21 to 30 of about 1,363,530 (305)

top-k Path Greedy Generalization Algorithm of Anonymity Shortest Path [PDF]

open access: yesJisuanji 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

Shortest Paths on Cubes

open access: yesThe College Mathematics Journal, 2021
35 pages, including 3 appendices and program ...
Richard Goldstone   +2 more
openaire   +2 more sources

Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path [PDF]

open access: yes, 2021
The problem of finding the shortest path from a path or graph has been quite widely discussed. There are also many algorithms that are the solution to this problem.
Syahputra, Dinur   +5 more
core   +1 more source

The Resource constrained shortest path problem implemented in a lazy functional language [PDF]

open access: yes, 1996
The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in FORTRAN or another imperative programming language.
Hartel, Pieter H., Glaser, Hugh
core   +2 more sources

Shortest Paths between Shortest Paths and Independent Sets [PDF]

open access: yes, 2011
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 that the sequence has polynomial length.
Kaminski, Marcin   +2 more
openaire   +4 more sources

Shortest paths with ordinal weights [PDF]

open access: yesEuropean Journal of Operational Research, 2020
24 pages, 8 figures, 2 ...
Luca E. Schäfer   +4 more
openaire   +4 more sources

AbcAeffchen/k-shortest-path: 1.0.0

open access: yes, 2023
Implementations of k-shortest-path algorithms used in some research ...
Alex Schickedanz
core   +1 more source

Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]

open access: yes, 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   +2 more sources

On the Shortest Path Game

open access: yesDiscrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Darmann   +2 more
openaire   +2 more sources

Shortest shortest path trees of a network

open access: yesDiscrete Applied Mathematics, 1996
If \(N\) is an undirected network where each edge has positive length, we may consider the distances of vertices from a specified internal point of an edge. A shortest path tree (SPT) rooted at \(s\) (possibly an internal point of an edge) is a spanning tree \(T\) of the network \(N[s]\) (i.e., \(N\) with \(s\) as possibly a new vertex) where for each ...
Pierre Hansen, Maolin Zheng
openaire   +1 more source

Home - About - Disclaimer - Privacy