Subgraph isomorphism problem (Q2528185)

From Wikidata
Jump to: navigation, 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

    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit