This registry entry contains a reference to the code, data and experimental scripts needed to reproduce the subgraph isomorphism paper:



Ciaran McCreesh and Patrick Prosser, "A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs". To appear at the 21st International Conference on Principles and Practice of Constraint Programming (CP 2015)

A Bruin de

BM Smith

C McCreesh

C Solnon

C-G Quimper

D Conte

E MacIntyre

G Audemard

G Chu

G Damiand

IP Gent

J Larrosa

JJ McGregor

JR Ullmann

LP Cordella

M Sevegnani

N Slater

O Lobachev

P Prosser

S Zampelli

T Coffman

V Bonnici

X Chen

The subgraph isomorphism problem involves finding a pattern

graph inside a target graph. We present a new bit- and thread-parallel

constraint-based search algorithm for the problem, and experiment on a

wide range of standard benchmark instances to demonstrate its effective-

ness. We introduce supplemental graphs, to create implied constraints.

We use a new low-overhead, lazy variation of con

ict directed backjump-

ing which interacts safely with parallel search, and a counting-based

all-different propagator which is better suited for large domains

McCreesh, Ciaran

Prosser, Patrick

Enlighten: Publications

A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs

Enlighten

English

Mccreesh, Ciaran

Enlighten: Research Data (University of Glasgow)

A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs

Ciaran McCreesh

Patrick Prosser

Crossref

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs

http://eprints.gla.ac.uk/107619/7/107619.pdf

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs

Abstract

Similar works

Full text

Available Versions

Enlighten: Publications

Enlighten

Enlighten: Research Data (University of Glasgow)

Crossref