A Partitioning Algorithm for Maximum Common Subgraph Problems

Cite

Text

McCreesh et al. "A Partitioning Algorithm for Maximum Common Subgraph Problems." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/99

Markdown

[McCreesh et al. "A Partitioning Algorithm for Maximum Common Subgraph Problems." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/mccreesh2017ijcai-partitioning/) doi:10.24963/IJCAI.2017/99

BibTeX

@inproceedings{mccreesh2017ijcai-partitioning,
  title     = {{A Partitioning Algorithm for Maximum Common Subgraph Problems}},
  author    = {McCreesh, Ciaran and Prosser, Patrick and Trimble, James},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {712-719},
  doi       = {10.24963/IJCAI.2017/99},
  url       = {https://mlanthology.org/ijcai/2017/mccreesh2017ijcai-partitioning/}
}