Solving Hard Subgraph Problems in Parallel

McCreesh, Ciaran

Solving Hard Subgraph Problems in Parallel

Download BibTeX Cite

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 4014-4014.

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.

Ciaran McCreesh. 2016. Solving Hard Subgraph Problems in Parallel. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 4014–4014. https://ijcai.org/proceedings/2016/581

@inproceedings{ijcai2016p581,
  title     = {Solving Hard Subgraph Problems in Parallel},
  author    = {McCreesh, Ciaran},
  booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
               Artificial Intelligence, {IJCAI-16}},
  publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
  editor    = {Subbarao Kambhampati},
  pages     = {4014--4014},
  year      = {2016},
  month     = {7},
  url       = {https://ijcai.org/proceedings/2016/581},
}

TY  - CPAPER
TI  - Solving Hard Subgraph Problems in Parallel
AU  - McCreesh, Ciaran
T2  - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16
PB  - AAAI Press / International Joint Conferences on Artificial Intelligence
PY  - 2016
SP  - 4014
EP  - 4014
UR  - https://ijcai.org/proceedings/2016/581
ER  -