127
click to vote
GD
1999
Springer
15 years 7 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
16 years 4 months ago
2000
IEEE
