Counting Subgraphs via Homomorphisms (Q5902149)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting Subgraphs via Homomorphisms |
scientific article; zbMATH DE number 5578333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting Subgraphs via Homomorphisms |
scientific article; zbMATH DE number 5578333 |
Statements
Counting Subgraphs via Homomorphisms (English)
0 references
14 July 2009
0 references
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
0 references
0 references
0.93149626
0 references
0.9273233
0 references
0.9231513
0 references
0.9187801
0 references
0.91861653
0 references
0.9181387
0 references
0.9170516
0 references
