Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Maximum_common_edge_subgraph_problem> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Maximum_common_edge_subgraph_problem abstract "Given two graphs and , the maximum common edge subgraph problem is the problem of finding a graph with a maximal number of edges which is isomorphic to a subgraph of and a subgraph of .The maximum common edge subgraph problem on general graphs is NP-complete as it is a generalization of subgraph isomorphism. Unless and are required to have the same number of vertices, the problem is APX-hard.".
- Maximum_common_edge_subgraph_problem wikiPageID "36037560".
- Maximum_common_edge_subgraph_problem wikiPageRevisionID "575676849".
- Maximum_common_edge_subgraph_problem hasPhotoCollection Maximum_common_edge_subgraph_problem.
- Maximum_common_edge_subgraph_problem subject Category:Graph_theory.
- Maximum_common_edge_subgraph_problem comment "Given two graphs and , the maximum common edge subgraph problem is the problem of finding a graph with a maximal number of edges which is isomorphic to a subgraph of and a subgraph of .The maximum common edge subgraph problem on general graphs is NP-complete as it is a generalization of subgraph isomorphism. Unless and are required to have the same number of vertices, the problem is APX-hard.".
- Maximum_common_edge_subgraph_problem label "Maximum common edge subgraph problem".
- Maximum_common_edge_subgraph_problem sameAs m.0jzz3p2.
- Maximum_common_edge_subgraph_problem sameAs Q6795885.
- Maximum_common_edge_subgraph_problem sameAs Q6795885.
- Maximum_common_edge_subgraph_problem wasDerivedFrom Maximum_common_edge_subgraph_problem?oldid=575676849.
- Maximum_common_edge_subgraph_problem isPrimaryTopicOf Maximum_common_edge_subgraph_problem.