Abu-Khzam, Faisal N.; Bonnet, Edouard; Sikora, Florian
(Springer, 2017-03-16)
Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NPNP -hard problems. MCIS remains NPNP -hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is ...