问题描述：
Maxmum common subgraph:
Input: Two graphs G1 = (V1,E1) and G2 = (V2,E2); a budget b. Input
Maxmum common subgraph:
Input: Two graphs G1 = (V1,E1) and G2 = (V2,E2); a budget b. Input
阅读背景：
【证明题】证明最大公共子图的NP完备
来源：互联网
分享到：
