✦ LIBER ✦

The Complexity of Counting in Sparse, Regular, and Planar Graphs

✍ Scribed by Vadhan, Salil P.

Book ID: 115545532
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 326 KB
Volume: 31
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539797321602

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of counting colourings an

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

✍ C. Greenhill 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 312 KB

The complexity of the chromatic sum prob

The complexity of the chromatic sum problem on cubic planar graphs and regular graphs

✍ Michal Malafiejski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 12 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

A Complexity Dichotomy for the Coloring

A Complexity Dichotomy for the Coloring of Sparse Graphs

✍ Louis Esperet; Mickaël Montassier; Pascal Ochem; Alexandre Pinlou 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 701 KB

The Computational Complexity of Tutte In

The Computational Complexity of Tutte Invariants for Planar Graphs

✍ Vertigan, Dirk 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 276 KB

On the Complexity of Canonical Labeling

On the Complexity of Canonical Labeling of Strongly Regular Graphs

✍ Babai, László 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 505 KB