The complexity of counting Eulerian tours in 4-regular graphs (Q2429360): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q3557056 |
||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
The Complexity of Counting Eulerian Tours in 4-Regular Graphs | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 5702188 | |||||||||||||||
Property / title | |||||||||||||||
The Complexity of Counting Eulerian Tours in 4-Regular Graphs (English) | |||||||||||||||
Property / title: The Complexity of Counting Eulerian Tours in 4-Regular Graphs (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1283.05133 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-642-12200-2_55 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: LATIN 2010: Theoretical Informatics / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
27 April 2010
| |||||||||||||||
Property / publication date: 27 April 2010 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 05C45 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 5702188 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2567789000 / rank | |||||||||||||||
Normal rank |
Revision as of 09:59, 6 May 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