{"type":"ScholarlyArticle","title":"Solving Hard Subgraph Problems in Parallel","authors":[{"name":"Ciaran McCreesh","slug":"ciaran-mccreesh","given":"Ciaran","family":"McCreesh","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2016/581","pdf":"https://ijcai.org/proceedings/2016/0581.pdf","markdown":"https://ijcai.org/proceedings/2016/581.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/581","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":581,"pages":{"first":4014,"last":4014},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}