Results 1  10
of
258,751
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
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
Buckets strike back: Improved Parallel ShortestPaths
 Proc. 16th Intl. Par. Distr. Process. Symp. (IPDPS
, 2002
"... We study the averagecase complexity of the parallel singlesource shortestpath (SSSP) problem, assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0; 1]. We provide a new bucketbased parallel SSSP algorithm that runs in T = O(log ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We study the averagecase complexity of the parallel singlesource shortestpath (SSSP) problem, assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0; 1]. We provide a new bucketbased parallel SSSP algorithm that runs in T = O
Engineering shortestpath algorithms for dynamic networks
"... Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems. In fact, the problem finds application in many realworld scenarios such as Internet routing and route planning in road networks. In t ..."
Abstract
 Add to MetaCart
Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems. In fact, the problem finds application in many realworld scenarios such as Internet routing and route planning in road networks
On Achieving the ShortestPath Routing in 2D Meshes ∗
"... In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortestpath between the source and the destination can always be found in the corresponding informationbased routing via routing decisions at each in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortestpath between the source and the destination can always be found in the corresponding informationbased routing via routing decisions at each
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 412 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
AverageCase Complexity of ShortestPaths Problems
, 2001
"... We study both upper and lower bounds on the averagecase complexity of shortestpaths algorithms. It is proved that the allpairs shortestpaths problem on nvertex networks can be solved in time O(n² log n) with high probability with respect to various probability distributions on the set of inputs. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study both upper and lower bounds on the averagecase complexity of shortestpaths algorithms. It is proved that the allpairs shortestpaths problem on nvertex networks can be solved in time O(n² log n) with high probability with respect to various probability distributions on the set of inputs
Complexity of finding embeddings in a ktree
 SIAM JOURNAL OF DISCRETE MATHEMATICS
, 1987
"... A ktree is a graph that can be reduced to the kcomplete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a ktree. This problem is motivated by the existence of polynomial time al ..."
Abstract

Cited by 386 (1 self)
 Add to MetaCart
algorithms for many combinatorial problems on graphs when the graph is constrained to be a partial ktree for fixed k. These algorithms have practical applications in areas such as reliability, concurrent broadcasting and evaluation of queries in a relational database system. We determine the complexity
Results 1  10
of
258,751