A new approach and faster exact methods for the maximum common subgraph problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph contained in both of them. MCS is frequently solved by reduction to the proble...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5408 http://dx.doi.org/10.1007/11533719_73 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007%2F11533719_73 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|