1056 search results - page 97 / 212 » Constraint-Based Graph Matching |
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
CATS
2008
13 years 10 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
JCT
2007
13 years 9 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...