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…