ML Anthology

Solving Hard Subgraph Problems in Parallel

Ciaran McCreesh
IJCAI 2016 pp. 4014-4015
/ijcai/2016/mccreesh2016ijcai-solving/

Abstract

We look at problems involving finding subgraphs in larger graphs, such as the maximum clique problem, the subgraph isomorphism problem, and the maximum common subgraph problem. We investigate variable and value ordering heuristics, different inference strategies, intelligent backtracking search (backjumping), and bit- and thread-parallelism to exploit modern hardware. PDF

PDF IJCAI Semantic Scholar

Cite

Text

McCreesh. "Solving Hard Subgraph Problems in Parallel." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[McCreesh. "Solving Hard Subgraph Problems in Parallel." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/mccreesh2016ijcai-solving/)

BibTeX

@inproceedings{mccreesh2016ijcai-solving,
  title     = {{Solving Hard Subgraph Problems in Parallel}},
  author    = {McCreesh, Ciaran},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {4014-4015},
  url       = {https://mlanthology.org/ijcai/2016/mccreesh2016ijcai-solving/}
}