Mael Minot

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The maximum common subgraph problem is an NP-hard problem which is very difficult to solve with exact approaches. To speed up the solution process, we may decompose it into independent subproblems which are solved in parallel. We describe a new decomposition method which exploits the structure of the problem to decompose it. We compare this structural(More)
  • 1