✦ LIBER ✦

The Complexity of Counting Eulerian Tours in

✍ Scribed by Qi Ge; Daniel Štefankovič

Book ID: 106149162
Publisher: Springer
Year: 2010
Tongue: English
Weight: 543 KB
Volume: 63
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-010-9463-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of counting homeomorphs

✍ Graham Farr; Colin McDiarmid 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 202 KB

On the number of spanning trees and Eule

On the number of spanning trees and Eulerian tours in iterated line digraphs

✍ Zhang Huaxiao; Zhang Fuji; Huang Qiongxiang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 448 KB

The complexity of counting graph homomor

The complexity of counting graph homomorphisms

✍ Martin Dyer; Catherine Greenhill 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

The Complexity of Planar Counting Proble

The Complexity of Planar Counting Problems

✍ Hunt, Harry B.; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 436 KB

The Parameterized Complexity of Counting

The Parameterized Complexity of Counting Problems

✍ Flum, Jörg; Grohe, Martin 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 347 KB

On the numbers of spanning trees and Eul

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 756 KB