Results 11 to 20 of about 1,848,326 (324)
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
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
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. [PDF]
Physical review. E, Statistical, nonlinear, and soft matter physics, 2000 Using computer databases of scientific papers in physics, biomedical research, and computer science, we have constructed networks of collaboration between scientists in each of these disciplines.
M. Newman, M. Newman
semanticscholar +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
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems [PDF]
Symposium on the Theory of Computing, 2019 We study the vertex-decremental Single-Source Shortest Paths (SSSP) problem: given an undirected graph G=(V,E) with lengths ℓ(e)≥ 1 on its edges that undergoes vertex deletions, and a source vertex s, we need to support (approximate) shortest-path ...
Julia Chuzhoy, S. Khanna
semanticscholar +1 more source
Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
Современные информационные технологии и IT-образование, 2021 There is a problem of finding the shortest paths between two vertices in an unweighted, undirected graph, which is aggravated by the fact that the available algorithms for finding all paths have a complexity of at least .
Valentin Sysoev
doaj +1 more source
Finding k-shortest paths with limited overlap
The VLDB journal, 2020 In this paper, we investigate the computation of alternative paths between two locations in a road network. More specifically, we study the k-shortest paths with limited overlap (kSPwLO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage ...
Theodoros Chondrogiannis +4 more
semanticscholar +1 more source
Fast approximate shortest paths in the congested clique [PDF]
Distributed computing, 2019 We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include: A (2+ϵ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
K. Censor-Hillel +3 more
semanticscholar +1 more source
Representative dissimilar path queries: accommodating human movement dynamics in road networks
Journal of Spatial Information Science, 2023 We introduce a representative dissimilar path (RDP) query, a novel type of path query in road networks. The k representative paths (RPs) between a source and a destination locations have k smallest costs for a feature (e.g., length, number of road ...
Tanzima Hashem +3 more
doaj +1 more source
Distributed exact shortest paths in sublinear time [PDF]
Symposium on the Theory of Computing, 2017 The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in O(n) time, where n is the number of vertices in the input
Michael Elkin
semanticscholar +1 more source