Results 1  10
of
276
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
ShortestPath Kernels on Graphs
 In Proceedings of the 2005 International Conference on Data Mining
, 2005
"... Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available by defining a kernel function on instances of graphs. Graph kernels based on walks, subtrees and cycles in graphs have bee ..."
Abstract

Cited by 62 (5 self)
 Add to MetaCart
propose graph kernels based on shortest paths. These kernels are computable in polynomial time, retain expressivity and are still positive definite. In experiments on classification of graph models of proteins, our shortestpath kernels show significantly higher classification accuracy than walk
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 139 (1 self)
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also
Shortestpath network interdiction
 Networks
, 2002
"... We study the problem of interdicting the arcs in anetwork in order to maximize the shortest s–t path length. “Interdiction”isanattackonanarcthatdestroysthearc or increases its effective length; there is alimited interdictionbudget.Weformulatethisbilevel,max–minproblem as amixedinteger program (MIP) ..."
Abstract

Cited by 50 (3 self)
 Add to MetaCart
. Computational results demonstrate ordersofmagnitude improvements of the decomposition algorithms over direct solution of the MIP and show that SVIs also help solve the original MIP
On Variants of ShortestPath Betweenness Centrality and their Generic Computation
 SOCIAL NETWORKS
, 2008
"... Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of ..."
Abstract

Cited by 79 (1 self)
 Add to MetaCart
Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants
Efficient data management in support of shortestpath computation
 In Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science, CTS ’11
, 2011
"... While many efficient proposals exist for solving the singlepair shortestpath problem, a solution that sees the algorithmic solution in combination with efficient data management has received considerably little attention. This work proposes a data management approach for efficient shortest path co ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
target large road networks that exhibit a high degree of change (e.g., OpenStreetMap). Extensive experimental evaluation shows that the presented solution is both efficient and scalable and provides competitive shortestpath computation performance without requiring a preprocessing stage for the road
Incremental ShortestPath Problem
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also
Routing in AdHoc Networks Using Minimum Connected Dominating Sets
, 1997
"... this paper, we impose a virtual backbone structure on the adhoc network, in order to support unicast, multicast, and faulttolerant routing within the adhoc network. This virtual backbone differs from the wired backbone of cellular networks in two key ways: (a) it may change as nodes move, and (b) ..."
Abstract

Cited by 297 (3 self)
 Add to MetaCart
) it is not used primarily for routing packets or flows, but only for computing and updating routes. The primary routes for packets and flows are still computed by a shortestpaths computation; the virtual backbone can, if necessary, provide backup routes to handle interim failures. Because of the dynamic nature
Combining SpeedUp Techniques for ShortestPath Computations
 In Proc. 3rd Workshop on Experimental and Efficient Algorithms. LNCS
, 2004
"... Computing a shortest path from one node to another in a directed graph is a very common task in practice. This problem is classically solved by Dijkstra's algorithm. Many techniques are known to speed up this algorithm heuristically, while optimality of the solution can still be guaranteed. ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
Computing a shortest path from one node to another in a directed graph is a very common task in practice. This problem is classically solved by Dijkstra's algorithm. Many techniques are known to speed up this algorithm heuristically, while optimality of the solution can still be guaranteed
Crowdsourcing computing resources for shortestpath computation
 Proceedings of the 20th International Conference on Advances in Geographic Information Systems
, 2012
"... ABSTRACT Crowdsourcing road network data, i.e., involving users to collect data including the detection and assessment of changes to the road network graph, poses a challenge to shortestpath algorithms that rely on preprocessing. Hence, current research challenges lie with improving performance by ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
ABSTRACT Crowdsourcing road network data, i.e., involving users to collect data including the detection and assessment of changes to the road network graph, poses a challenge to shortestpath algorithms that rely on preprocessing. Hence, current research challenges lie with improving performance
Results 1  10
of
276