Algorithmic Aspects of the Local Lemma

Molloy, Michael; Reed, Bruce

doi:10.1007/978-3-642-04016-0_25

Michael Molloy⁴ &
Bruce Reed^5,6

Part of the book series: Algorithms and Combinatorics ((AC,volume 23))

1352 Accesses

Abstract

In this chapter, we discuss finding proper 2-colourings of hypergraphs where each edge intersects a bounded number of other edges.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 119.00; Price excludes VAT (USA)

Hardcover Book: USD 159.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Department of Computer Science, University of Toronto, 10 King’s College Road, M5S 3G4, Toronto, Ontario, Canada
Michael Molloy
Université de Paris VI, CNRS, 4, Place Jussieu, 75252, Paris Cedex 05, France
Bruce Reed
School of Computer Science, McGill University, 3480 University Avenue, H3A 2A7, Montreal, Quebec, Canada
Bruce Reed

Authors

Michael Molloy
View author publications
You can also search for this author in PubMed Google Scholar
Bruce Reed
View author publications
You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Molloy, M., Reed, B. (2002). Algorithmic Aspects of the Local Lemma. In: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04016-0_25

Download citation

DOI: https://doi.org/10.1007/978-3-642-04016-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics