Maximum common edge subgraph
id:
maximum-common-edge-subgraph-323-9719983
title:
Maximum common edge subgraph
text:
Given two graphs G and G ′ , the maximum common edge subgraph problem is the problem of finding a graph H with as many edges as possible which is isomorphic to both a subgraph of G and a subgraph of G ′ . The maximum common edge subgraph problem on general graphs is NP-complete as it is a generalization of subgraph isomorphism: a graph H is isomorphic to a subgraph of another graph G if and only if the maximum common edge subgraph of G and H has the same number of edges as H . Unless the two inp
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Maximum_common_edge_subgraph
date created:
date modified:
2024-04-22T00:21:56Z
main entity:
{"identifier":"Q6795885","url":"https://www.wikidata.org/entity/Q6795885"}
image:
fields total:
13
integrity:
13