17 search results - page 2 / 4 » A Direct Algorithm to Find a Largest Common Connected Induce... |
GD
1999
Springer
13 years 9 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
TCS
2008
13 years 5 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
CVPR
2010
IEEE
13 years 3 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
CSE
2009
IEEE
14 years 2 days ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
IJSNET
2007
13 years 5 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...