Sequential and parallel solution-biased search for subgraph algorithms

DOI10.1007/978-3-030-19212-9_2MaRDI QIDQ2327237zbMATH OpenOpenAlexFDO

Authors Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble

Publication date 14 October 2019

Full work available at URL http://eprints.gla.ac.uk/180906/

Mathematics Subject Classification ID

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

Recommendations

• Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
• A parallel search algorithm for directed acyclic graphs
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
• Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
• Parallel search algorithms for graphs and trees
• Parallel Complexity of the Connected Subgraph Problem
• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
• Fast parallel graph searching with applications

Cited in

(4)

• Finding subgraphs with side constraints
• SLF: a passive parallelization of subgraph isomorphism
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• PathLAD+: Towards effective exact methods for subgraph isomorphism problem

This page was built for publication: Sequential and parallel solution-biased search for subgraph algorithms

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