Observations from parallelising three maximum common (connected) subgraph algorithms
From MaRDI portal
Publication:1626749
DOI10.1007/978-3-319-93031-2_22OpenAlexW2796193135MaRDI QIDQ1626749
Ruth Hoffmann, Christine Solnon, Craig Reilly, Patrick Prosser, James Trimble, Ciaran McCreesh, Samba Ndojh Ndiaye
Publication date: 21 November 2018
Full work available at URL: http://eprints.gla.ac.uk/157151/7/157151.pdf
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
This page was built for publication: Observations from parallelising three maximum common (connected) subgraph algorithms