Maximum common edge subgraph
ID: maximum-common-edge-subgraph
The Maximum Common Edge Subgraph (MCES) is a concept from graph theory, specifically in the context of comparing two undirected graphs. The goal of the MCES is to identify a subgraph that maximizes the number of edges that are common to both input graphs.
New to topics? Read the docs here!