Finding subgraphs with side constraints
From MaRDI portal
Publication:2117235
DOI10.1007/978-3-030-78230-6_22OpenAlexW3169046758MaRDI QIDQ2117235
Özgür Akgün, Patrick Prosser, Christopher Jefferson, Steffen Zschaler, Ciaran McCreesh, Jessica Enright
Publication date: 21 March 2022
Full work available at URL: http://eprints.gla.ac.uk/239426/1/239426.pdf
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Amalgamation of domain specific languages with behaviour
- Solving subgraph isomorphism problems with constraint programming
- Essence: A constraint language for specifying combinatorial problems
- Sequential and parallel solution-biased search for subgraph algorithms
- A parallel branch and bound algorithm for the maximum labelled clique problem
- Fundamentals of algebraic graph transformation
- The dynamic nature of contact networks in infectious disease epidemiology
- Propagation = Lazy Clause Generation
- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
- The Secret Life of Keys: On the Calculation of Mechanical Lock Systems
This page was built for publication: Finding subgraphs with side constraints
