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

no code implementations • 18 Aug 2022 • Yanli Liu, Jiming Zhao, Chu-min Li, Hua Jiang, Kun He

Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for MCS, consisting in successively selecting vertices to match and pruning when it is discovered that a solution better than the best solution found so far does not exist.

Reinforcement Learning (RL)