✦ LIBER ✦

Counting and sampling H-colourings

✍ Scribed by Martin Dyer; Leslie Ann Goldberg; Mark Jerrum

Book ID: 113641487
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 263 KB
Volume: 189
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2003.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Absolute liquid scintillation counting o

Absolute liquid scintillation counting of coloured samples of β-emitters using integral counting techniques

✍ Y. Homma; Y. Murase; K. Sonehara 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 275 KB

Pseudorandomness for Approximate Countin

Pseudorandomness for Approximate Counting and Sampling

✍ Ronen Shaltiel; Christopher Umans 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 355 KB

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

Greedy algorithms, H-colourings and a co

Greedy algorithms, H-colourings and a complexity-theoretic dichotomy

✍ Antonio Puricella; Iain A. Stewart 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 566 KB

Let H be a ÿxed undirected graph. An H -colouring of an undirected graph G is a homomorphism from G to H . If the vertices of G are partially ordered then there is a generic non-deterministic greedy algorithm which computes all lexicographically ÿrst maximal Hcolourable subgraphs of G. We show that

Distance-regular graphs, MH-colourings a

Distance-regular graphs, MH-colourings and MLD-colourings

✍ T.S. Griggs; B.J. Wilson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 199 KB

A double-sampling extended-counting ADC

✍ De Maeyer, J.; Rombouts, P.; Weyten, L. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 492 KB