1327 search results - page 118 / 266 » Path following algorithm for the graph matching problem |
112
click to vote
DM
1999
15 years 1 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
IROS
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, we address the problem of creating an objective benchmark for comparing SLAM approaches. We propose a framework for analyzing the results of SLAM approaches base...
112
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
109
click to vote
ICPP
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...