A portfolio that runs parallel CPU and GPU versions of the McSplit algorithm together solves more maximum common subgraph benchmark instances within time limits than any single version.
A partitioning algorithm for maximum common subgraph problems,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Maximum Common Subgraph Problem: A Portfolio Approach
A portfolio that runs parallel CPU and GPU versions of the McSplit algorithm together solves more maximum common subgraph benchmark instances within time limits than any single version.