796 search results - page 9 / 160 » The Anonymous Subgraph Problem |
WADS
1989
Springer
13 years 11 months ago
1989
Springer
CATS
2008
13 years 8 months ago
2008
EVOW
2005
Springer
14 years 27 days ago
2005
Springer
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
RSA
2011
13 years 2 months ago
2011
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
PKDD
2004
Springer
14 years 22 days ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...