Q2528185

From Wikidata
Jump to: navigation, search

Subgraph isomorphism problem (Q2528185)[edit]

the NP-complete problem of testing whether one graph is a subgraph of another [edit]

No aliases defined. [add]

Statements

/m/029xb6
[edit]
1 reference
[add]