Results 1  10
of
1,026,297
Dynamic Shortest Path . . .
"... A hypergraph is a set V of vertices and a set of nonempty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higherorder interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path pro ..."
Abstract
 Add to MetaCart
problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first addressing the fully dynamic shortest path problem in a general hypergraph. They complement each other
On dynamic shortest paths problems
 In ESA: Annual European Symposium on Algorithms
, 2004
"... Abstract. We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
Abstract. We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard
Dynamic Shortest Paths Containers
, 2004
"... Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G =(V,E), we store, for each edge (u, v) ∈ E, the bounding box of all nodes t ∈ V for which a shortest utpath sta ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
starts with (u, v). Shortest path queries can then be answered by Dijkstra’s algorithm restricted to edges where the corresponding bounding box contains the target. In this paper, we present new algorithms as well as an empirical study for the dynamic case of this problem, where edge weights are subject
ON SOLVING DYNAMIC SHORTEST PATH PROBLEMS
 EUROPT2008, MAY 20–23, 2008, NERINGA, LITHUANIA
, 2008
"... Given a dynamic network with n nodes and m arcs in which all attributes including travel times, travel costs and waiting costs may change dynamically over a time horizon T. The dynamic shortest path problem is to determine a path from a specified source node to every other node with minimal total c ..."
Abstract
 Add to MetaCart
Given a dynamic network with n nodes and m arcs in which all attributes including travel times, travel costs and waiting costs may change dynamically over a time horizon T. The dynamic shortest path problem is to determine a path from a specified source node to every other node with minimal total
Dynamic Shortest Path Algorithms for Hypergraphs
"... Abstract—A hypergraph is a set V of vertices and a set of nonempty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higherorder interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest ..."
Abstract
 Add to MetaCart
path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first addressing the fully dynamic shortest path problem in a general hypergraph. They complement each
Dynamic Shortest Path Algorithms for Hypergraphs
"... Abstract—A hypergraph is a set V of vertices and a set of nonempty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higherorder interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest ..."
Abstract
 Add to MetaCart
path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first addressing the fully dynamic shortest path problem in a general hypergraph. They complement each
Dynamic Shortest Path Algorithms for Hypergraphs
"... A hypergraph is a set V of vertices and a set of nonempty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higherorder interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path pro ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph. They complement each other
Dynamic Shortest Path Algorithms for Hypergraphs
"... Abstract—A hypergraph is a set V of vertices and a set of nonempty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higherorder interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortes ..."
Abstract
 Add to MetaCart
path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph. They complement each
Improved Algorithms for Dynamic Shortest Paths
, 2000
"... We describe algorithms for finding shortest paths and distances in outerplanar and planar digraphs that exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic environment, where the cost of any edge can be changed or the edge ca ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We describe algorithms for finding shortest paths and distances in outerplanar and planar digraphs that exploit the particular topology of the input graph. An important feature of our algorithms is that they can work in a dynamic environment, where the cost of any edge can be changed or the edge
ContinuousTime Dynamic Shortest Path Algorithms
, 1999
"... We consider the problem of computing shortest paths through a dynamic network – a network with timevarying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic beha ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
We consider the problem of computing shortest paths through a dynamic network – a network with timevarying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic
Results 1  10
of
1,026,297