• DocumentCode
    3449772
  • Title

    Improved bounds for sampling colorings

  • Author

    Vigoda, Eric

  • Author_Institution
    Comput. Sci. Div., California Univ., Berkeley, CA, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    51
  • Lastpage
    59
  • Abstract
    We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree Δ. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 Δ
  • Keywords
    computational complexity; graph colouring; O(nk log n); design Markov chain; k-colorings; sampling; sampling colorings; Antiferromagnetic materials; Computer science; Labeling; Lattices; Microwave integrated circuits; Physics; Polynomials; Radio access networks; Sampling methods; Temperature;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1999. 40th Annual Symposium on
  • Conference_Location
    New York City, NY
  • ISSN
    0272-5428
  • Print_ISBN
    0-7695-0409-4
  • Type

    conf

  • DOI
    10.1109/SFFCS.1999.814577
  • Filename
    814577
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3449772