About: Maximum common induced subgraph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

unknown

Property	Value
dbo:wikiPageWikiLink	dbc:NP-complete_problems dbc:Computational_problems_in_graph_theory dbr:Clique_(graph_theory) dbc:Cheminformatics dbr:Maximum_independent_set dbr:Maximum_common_edge_subgraph dbr:Clique_problem dbr:Graph_theory dbr:Theoretical_computer_science dbr:Subgraph_isomorphism_problem dbr:Induced_subgraph dbr:Cheminformatics dbr:Approximation_algorithm dbr:Look-ahead_(backtracking) dbr:Hardness_of_approximation dbr:Pharmacophore dbr:Decision_problem dbr:Modular_product_of_graphs dbr:Molecule_mining dbr:NP-complete dbr:NP-hard dbr:Polynomial_time dbr:P_=_NP
dbp:wikiPageUsesTemplate	dbt:Reflist
dct:subject	dbc:NP-complete_problems dbc:Computational_problems_in_graph_theory dbc:Cheminformatics
rdfs:label	Maximum common induced subgraph (en)
owl:sameAs	yago-res:Maximum common induced subgraph wikidata:Maximum common induced subgraph dbpedia-global:Maximum common induced subgraph
prov:wasDerivedFrom	wikipedia-en:Maximum_common_induced_subgraph?oldid=1239927405&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Maximum_common_induced_subgraph
is dbo:wikiPageWikiLink of	dbr:Clique_problem dbr:Modular_product_of_graphs dbr:Maximum_common_subgraph
is foaf:primaryTopic of	wikipedia-en:Maximum_common_induced_subgraph

This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International