The complexity of counting Eulerian tours in 4-regular graphs (Q2429360): Difference between revisions
From MaRDI portal
Latest revision as of 03:39, 5 July 2024
scientific article; zbMATH DE number 5702188
- The Complexity of Counting Eulerian Tours in 4-Regular Graphs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting Eulerian tours in 4-regular graphs |
scientific article; zbMATH DE number 5702188 |
|
Statements
The complexity of counting Eulerian tours in 4-regular graphs (English)
0 references
The Complexity of Counting Eulerian Tours in 4-Regular Graphs (English)
0 references
26 April 2012
0 references
27 April 2010
0 references
Eulerian tours
0 references
A-trails
0 references
\#P-complete
0 references
AP-reduction
0 references
fully polynomial randomized approximation scheme
0 references
0 references
