1327 search results - page 20 / 266 » Path following algorithm for the graph matching problem |
198
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
147
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
138
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
130
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
171
Voted
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...