Faster algorithms for finding and counting subgraphs (Q439930)

From MaRDI portal
Revision as of 01:16, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Faster algorithms for finding and counting subgraphs
scientific article

    Statements

    title
    Faster algorithms for finding and counting subgraphs (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Daniel Lokshtanov
    0 references
    Venkatesh Raman
    0 references
    Saket Saurabh
    0 references
    B. V. Raghavendra Rao
    0 references
    publication date
    17 August 2012
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    68Q25
    0 references
    05C60
    0 references
    05C30
    0 references
    05C05
    0 references
    68R10
    0 references
    68W20
    0 references
    zbMATH DE Number
    6067699
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    subgraph isomorphism
    0 references
    homomorphism
    0 references
    counting
    0 references
    treewidth
    0 references
    Wikidata QID
    Q60488486
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q439930&oldid=25579247"
    Powered by MediaWiki