A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem

Jianrong Zhou, Kun He 0001, Jiongzhi Zheng, Chu Min Li, Yanli Liu 0001. A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. In Luc De Raedt, editor, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022. pages 1908-1914, ijcai.org, 2022. [doi]

Abstract

Abstract is missing.