The complexity of counting Eulerian tours in 4-regular graphs (Q2429360)
From MaRDI portal
(Redirected from Item:Q3557056)
 | 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 Eulerian tours in 4-regular graphs |
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
0.9999999
0 references
0.90331566
0 references
0.9024967
0 references
0.8904122
0 references
0.88612235
0 references
0 references
0 references
0.8747058
0 references
0.8679406
0 references
