Counting Subgraphs via Homomorphisms (Q5902149)

From MaRDI portal
Revision as of 22:00, 4 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60488681, #quickstatements; #temporary_batch_1712260040974)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5578333
Language Label Description Also known as
English
Counting Subgraphs via Homomorphisms
scientific article; zbMATH DE number 5578333

    Statements

    title
    Counting Subgraphs via Homomorphisms (English)
    0 references
    author
    Omid Amini
    0 references
    Fedor V. Fomin
    0 references
    Saket Saurabh
    0 references
    publication date
    14 July 2009
    0 references
    Mathematics Subject Classification ID
    05C30
    0 references
    05C85
    0 references
    68R05
    0 references
    zbMATH DE Number
    5578333
    0 references
    zbMATH Keywords
    counting graph homomorphisms
    0 references
    exact algorithms
    0 references
    parametrized algorithms
    0 references
    counting subgraphs
    0 references
    computing chromatic polynomial
    0 references
    counting Hamiltonian cycles
    0 references
    counting perfect matchings
    0 references
    color coding based algorithms
    0 references
    OpenAlex ID
    W1604283551
    0 references
    Wikidata QID
    Q60488681
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5902149&oldid=33241207"
    Powered by MediaWiki