Hard Graph Problems - Theory and in Practice

Lead Research Organisation: University of Glasgow
Department Name: School of Computing Science

Abstract

Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.

Studentship Projects

Project Reference Relationship Related To Start End Student Name
EP/N509668/1 30/09/2016 29/09/2021
1804156 Studentship EP/N509668/1 30/09/2016 03/10/2022 James Trimble
EP/R513222/1 30/09/2018 29/09/2023
1804156 Studentship EP/R513222/1 30/09/2016 03/10/2022 James Trimble
 
Description We have developed new, faster algorithms for maximum common subgraph problems. These algorithms can be used, for example, to find a large sub-molecule that appears in each of two given molecules.
Exploitation Route The algorithms may be used to improve visualisation tools for pairs of molecules.
Sectors Chemicals

Healthcare

URL https://dblp.uni-trier.de/pers/hd/t/Trimble_0001:James