subgraph isomorphism problem (Q2528185)

From Wikidata
Jump to navigation Jump to search
the NP-complete problem of testing whether one graph is a subgraph of another
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

    Identifiers