5473 search results - page 196 / 1095 » On the graph isomorphism problem |
155
click to vote
CCCG
2009
15 years 8 months ago
2009
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
157
click to vote
CLASSIFICATION
2008
15 years 7 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
212
click to vote
HEURISTICS
2006
15 years 7 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
199
click to vote
ESA
1997
Springer
15 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
198
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...