The complexity of counting Eulerian tours in 4-regular graphs (Q2429360): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q196037 |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(6 intermediate revisions by 5 users not shown) | |||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
The Complexity of Counting Eulerian Tours in 4-Regular Graphs | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article | 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 / author | |||||||||||||||
Property / author: Daniel Štefanković / 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 / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2099831741 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2567789000 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1009.5019 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On non-intersecting Eulerian circuits / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The relative complexity of approximate counting problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The complexity of counting Eulerian tours in 4-regular graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4798347 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Random sampling of Euler tours / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4782696 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Mixing times of lozenge tiling and card shuffling Markov chains / rank | |||||||||||||||
Normal rank |
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