Finding subgraphs with side constraints

DOI10.1007/978-3-030-78230-6_22MaRDI QIDQ2117235zbMATH OpenOpenAlexFDO

Authors Özgür Akgün, Jessica Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler

Publication date 21 March 2022

Full work available at URL http://eprints.gla.ac.uk/239426/1/239426.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites work

• A parallel branch and bound algorithm for the maximum labelled clique problem
• Amalgamation of domain specific languages with behaviour
• Essence: A constraint language for specifying combinatorial problems
• Fundamentals of algebraic graph transformation
• Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
• Propagation = Lazy Clause Generation
• Sequential and parallel solution-biased search for subgraph algorithms
• Solving subgraph isomorphism problems with constraint programming
• The dynamic nature of contact networks in infectious disease epidemiology
• 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

Describes a project that uses

Uses Software

• Glasgow subgraph solver
• MINION
• Essence

This page was built for publication: Finding subgraphs with side constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117235)