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.
    [edit]

    Statements

    [edit]
    Language Code Linked page
    English enwiki
    español eswiki
    italiano itwiki
    polski plwiki
    português ptwiki
    српски / srpski srwiki
    Tiếng Việt viwiki
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]