GD
1999
Springer
14 years 3 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...
ICPR
2000
IEEE
15 years 17 days ago
2000
IEEE
