Sequential and parallel solution-biased search for subgraph algorithms

Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh*, Patrick Prosser, James Trimble

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)
5 Downloads (Pure)

Abstract

The current state of the art in subgraph isomorphism solving involves using degree as a value-ordering heuristic to direct backtracking search. Such a search makes a heavy commitment to the first branching choice, which is often incorrect. To mitigate this, we introduce and evaluate a new approach, which we call “solution-biased search”. By combining a slightly-random value-ordering heuristic, rapid restarts, and nogood recording, we design an algorithm which instead uses degree to direct the proportion of search effort spent in different subproblems. This increases performance by two orders of magnitude on satisfiable instances, whilst not affecting performance on unsatisfiable instances. This algorithm can also be parallelised in a very simple but effective way: across both satisfiable and unsatisfiable instances, we get a further speedup of over thirty from thirty-six cores, and over one hundred from ten distributed-memory hosts. Finally, we show that solution-biased search is also suitable for optimisation problems, by using it to improve two maximum common induced subgraph algorithms.
Original languageEnglish
Title of host publicationIntegration of Constraint Programming, Artificial Intelligence, and Operations Research
Subtitle of host publication16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings
EditorsLouis-Martin Rousseau, Kostas Stergiou
Place of PublicationCham
PublisherSpringer
Pages20-38
Number of pages19
ISBN (Electronic)9783030192129
ISBN (Print)9783030192112
DOIs
Publication statusPublished - 2019
Event16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019 - Thessaloniki, Greece
Duration: 4 Jun 20197 Jun 2019
Conference number: 16
http://cpaior2019.uowm.gr/

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11494 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2019
Abbreviated titleCPAIOR 2019
Country/TerritoryGreece
CityThessaloniki
Period4/06/197/06/19
Internet address

Fingerprint

Dive into the research topics of 'Sequential and parallel solution-biased search for subgraph algorithms'. Together they form a unique fingerprint.

Cite this