The Computational Complexity of Tutte Invariants for Planar Graphs (Q5470709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5029545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Computational Complexity of Tutte Invariants for Planar Graphs |
scientific article; zbMATH DE number 5029545 |
Statements
The Computational Complexity of Tutte Invariants for Planar Graphs (English)
0 references
1 June 2006
0 references
Tutte polynomial
0 references
Potts model
0 references
knot polynomials
0 references
planar graphs
0 references
polynomial time
0 references
\(\#P\)-complete
0 references
enumeration
0 references
reliability
0 references
percolation
0 references
0.8623171448707581
0 references
0.855181097984314
0 references
0.8519800901412964
0 references
0.8448201417922974
0 references
0.8446831107139587
0 references
