The complexity of counting Eulerian tours in 4-regular graphs (Q2429360): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q196037 |
Changed an Item |
||
| Property / author | |||
| Property / author: Daniel Štefanković / rank | |||
Normal rank | |||
Revision as of 12:48, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting Eulerian tours in 4-regular graphs |
scientific article |
Statements
The complexity of counting Eulerian tours in 4-regular graphs (English)
0 references
26 April 2012
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
