Unknown

Dataset Information

0

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants


ABSTRACT: The Glasgow Subgraph Solver provides an implementation of state of the art algorithms for subgraph isomorphism problems. It combines constraint programming concepts with a variety of strong but fast domain-specific search and inference techniques, and is suitable for use on a wide range of graphs, including many that are found to be computationally hard by other solvers. It can also be equipped with side constraints, and can easily be adapted to solve other subgraph matching problem variants. We outline its key features from the view of both users and algorithm developers, and discuss future directions.

SUBMITTER: Gadducci F 

PROVIDER: S-EPMC7314700 | biostudies-literature | 2020 May

REPOSITORIES: biostudies-literature

Similar Datasets

| S-EPMC3633016 | biostudies-literature
| S-EPMC8219732 | biostudies-literature
| S-EPMC6777974 | biostudies-literature
| S-EPMC4256833 | biostudies-other
| S-EPMC8421572 | biostudies-literature
| S-EPMC4459189 | biostudies-other
| S-EPMC4558012 | biostudies-literature
| S-EPMC539352 | biostudies-literature
| S-EPMC4908349 | biostudies-literature
| S-EPMC10449398 | biostudies-literature