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]

@inproceedings{Zhou0ZL022,
  title = {A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem},
  author = {Jianrong Zhou and Kun He 0001 and Jiongzhi Zheng and Chu Min Li and Yanli Liu 0001},
  year = {2022},
  doi = {10.24963/ijcai.2022/265},
  url = {https://doi.org/10.24963/ijcai.2022/265},
  researchr = {https://researchr.org/publication/Zhou0ZL022},
  cites = {0},
  citedby = {0},
  pages = {1908-1914},
  booktitle = {Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022},
  editor = {Luc De Raedt},
  publisher = {ijcai.org},
}