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.

Ancestors (6)

  1. Cheminformatics
  2. Applied statistics
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version