2 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 2 cited
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
Jianrong Zhou, Kun He, Jiongzhi Zheng +2
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) a…
cs.LG2019★ 2 cited
A Learning based Branch and Bound for Maximum Common Subgraph Problems
Yan-li Liu, Chu-min Li, Hua Jiang +1
Branch-and-bound (BnB) algorithms are widely used to solve combinatorial problems, and the performance crucially depends on its branching heuristic.In this work, we consider a typi…