The following pages link to Ciaran McCreesh (Q1626746):
Displaying 9 items.
- Observations from parallelising three maximum common (connected) subgraph algorithms (Q1626749) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Finding subgraphs with side constraints (Q2117235) (← links)
- Sequential and parallel solution-biased search for subgraph algorithms (Q2327237) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- A review of literature on parallel constraint solving (Q4559826) (← links)
- When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases (Q4639034) (← links)
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants (Q5100743) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
