✦ LIBER ✦

A maximum independent set approach for collusion detection in voting pools

✍ Scribed by Filipe Araujo; Jorge Farinha; Patricio Domingues; Gheorghe Cosmin Silaghi; Derrick Kondo

Book ID: 113743662
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 917 KB
Volume: 71
Category: Article
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2011.06.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-price approach for the maxi

A branch-and-price approach for the maximum weight independent set problem

✍ Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

Algorithms for Maximum Independent Set i

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

✍ José Soares; Marco A. Stefanes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 371 KB

Finding a Maximum Independent Set in a S

Finding a Maximum Independent Set in a Sparse Random Graph

✍ Feige, Uriel; Ofek, Eran 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 333 KB

An optimal time algorithm for finding a

An optimal time algorithm for finding a maximum weight independent set in a tree

✍ G. H. Chen; M. T. Kuo; J. P. Sheu 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 147 KB

Tabaris: An exact algorithm based on tab

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

✍ C. Friden; A. Hertz; D. de Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 809 KB

Very rapidly mixing Markov chains for 2Δ

Very rapidly mixing Markov chains for 2Δ-colorings and for independent sets in a graph with maximum degree 4

✍ Michael Molloy 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 1 views

We introduce a new technique for analyzing the mixing rate of Markov chains. We use it to prove that the Glauber dynamics on 2 -colorings of a graph with maximum degree mixes in O n log n time. We prove the same mixing rate for the Insert/Delete/Drag chain of Dyer and Greenhill (Random Structures A