activity
20192024
most citedA Learning based Branch and Bound for Maximum Common Subgraph Problems

2 citations · 6 across the 6 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

cs.AI2022★ 1 cited

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem

Yanli Liu, Jiming Zhao, Chu-Min Li +2

Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for…