The Maximum Common Induced Subgraph (MCIS) problem is a well-known computational problem in the field of graph theory and computer science. Given two graphs, the goal of the MCIS problem is to find the largest subgraph that is isomorphic to subgraphs of both input graphs. In other words, the task is to identify the largest set of vertices that can form an induced subgraph in both graphs while maintaining the same connectivity.
Articles by others on the same topic
There are currently no matching articles.