Counting Subgraphs via Homomorphisms (Q5902149): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60488681, #quickstatements; #temporary_batch_1712260040974 |
Created claim: DBLP publication ID (P1635): conf/icalp/AminiFS09, #quickstatements; #temporary_batch_1731483406851 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/icalp/AminiFS09 / rank | |||
Normal rank | |||
Latest revision as of 09:30, 13 November 2024
scientific article; zbMATH DE number 5578333
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
