Maximum common induced subgraph parameterized by vertex cover
The Maximum Common Induced Subgraph problem (MCIS ) takes a pair of graphs as input and asks for a graph of maximum order that is isomorphic to an induced subgraph of each of the input graphs. The problem is NP-hard in general, and remains so on many graph classes including graphs of bounded treewid...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10725/2780 http://dx.doi.org/10.1016/j.ipl.2013.11.007 http://www.sciencedirect.com/science/article/pii/S0020019013002755 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!