The complexity of counting in sparse, regular, and planar graphs (Q2784460)
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: The complexity of counting in sparse, regular, and planar graphs |
scientific article; zbMATH DE number 1732350
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting in sparse, regular, and planar graphs |
scientific article; zbMATH DE number 1732350 |
Statements
23 April 2002
0 references
\(\#\mathcal P\)
0 references
completeness
0 references
matchings
0 references
vertex covers
0 references
independent sets
0 references
Fibonacci numbers
0 references
polynomial interpolation
0 references
The complexity of counting in sparse, regular, and planar graphs (English)
0 references
