Are unique subgraphs not easier to find? (Q1707980)

From MaRDI portal
Revision as of 21:03, 25 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Are unique subgraphs not easier to find?
scientific article

    Statements

    Are unique subgraphs not easier to find? (English)
    0 references
    0 references
    0 references
    4 April 2018
    0 references
    subgraph isomorphism
    0 references
    induced subgraph isomorphism
    0 references
    unique subgraph occurrence
    0 references
    time complexity
    0 references

    Identifiers