The complexity of counting Eulerian tours in 4-regular graphs (Q2429360): Difference between revisions

← Older edit

@@ 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)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05133
@@ Property / zbMATH Open document ID: 1283.05133 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-12200-2_55
@@ Property / DOI: 10.1007/978-3-642-12200-2_55 / rank @@
+Normal rank
@@ Property / published in @@
+LATIN 2010: Theoretical Informatics
@@ Property / published in: LATIN 2010: Theoretical Informatics / rank @@
+Normal rank
@@ Property / publication date @@
+April 2010Timestamp +2010-04-27T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2010-04-27T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 27 April 2010 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C45
@@ Property / Mathematics Subject Classification ID: 05C45 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5702188
@@ Property / zbMATH DE Number: 5702188 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2099831741
@@ Property / OpenAlex ID: W2099831741 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2567789000
@@ Property / OpenAlex ID: W2567789000 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5019
@@ Property / arXiv ID: 1009.5019 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
+Normal rank
@@ Property / cites work @@
+On non-intersecting Eulerian circuits
@@ Property / cites work: On non-intersecting Eulerian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+Eulerian graphs and related topics. Part 1, Volume 1
+Normal rank
@@ Property / cites work @@
+The complexity of counting Eulerian tours in 4-regular graphs
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Random sampling of Euler tours
@@ Property / cites work: Random sampling of Euler tours / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixing times of lozenge tiling and card shuffling Markov chains
+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	The Complexity of Counting Eulerian Tours in 4-Regular Graphs