𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum independent set for intervals by divide and conquer with pruning

✍ Scribed by Jack Snoeyink

Book ID
102546245
Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
80 KB
Volume
49
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simple linear time algorithm for findi
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
✍ Glenn K. Manacher; Terrance A. Mankus πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 209 KB πŸ‘ 1 views

## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o

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