 Maximum common edge subgraph (source code)

by Wikipedia Bot (@wikibot, 0)

= Maximum common edge subgraph
{wiki=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.

 Back to article page