Ian P. Gent

activity

19932026

most citedBackbone Fragility and the Local Search Cost Peak

79 citations · 114 across the 23 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018★ 2 cited

Solving computational problems in the theory of word-representable graphs

Özgür Akgün, Ian P. Gent, Sergey Kitaev +1

A simple graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ iff $x y \in E$ . Word-representable gra…

cs.AI2018

A Review of Literature on Parallel Constraint Solving

Ian P. Gent, Ciaran McCreesh, Ian Miguel +4

As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to explo…