Subgraph isomorphism problem (Q2528185)

From Wikidata
Jump to: navigation, search
the NP-complete problem of testing whether one graph is a subgraph of another
    No aliases defined
[edit]
Language Label Description Also known as
English
Subgraph isomorphism problem
the NP-complete problem of testing whether one graph is a subgraph of another

    Statements

    /m/029xb6
    1 reference