Are unique subgraphs not easier to find? (Q1707980)

From MaRDI portal
Revision as of 10:27, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Are unique subgraphs not easier to find? (English)
    0 references
    author
    Mirosław Kowaluk
    0 references
    Andrzej Lingas
    0 references
    publication date
    4 April 2018
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C60
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6855757
    0 references
    zbMATH Keywords
    subgraph isomorphism
    0 references
    induced subgraph isomorphism
    0 references
    unique subgraph occurrence
    0 references
    time complexity
    0 references
    OpenAlex ID
    W2790074285
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1707980&oldid=36381963"
    Powered by MediaWiki