Unique subgraphs are not easier to find (Q2855752)

From MaRDI portal
Revision as of 08:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Unique subgraphs are not easier to find
scientific article

    Statements

    title
    Unique subgraphs are not easier to find (English)
    0 references
    author
    Mirosław Kowaluk
    0 references
    Eva-Marta Lundell
    0 references
    Andrzej Lingas
    0 references
    publication date
    22 October 2013
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    unique subgraph occurrence
    0 references
    subgraph isomorphism
    0 references
    induced subgraph isomorphism
    0 references
    time complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C60
    0 references
    05C85
    0 references
    zbMATH DE Number
    6217936
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2855752&oldid=27298102"
    Powered by MediaWiki