{"title":"Improved bounds for sampling colorings","authors":"Eric Vigoda","doi":"10.1109/SFFCS.1999.814577","DOIUrl":null,"url":null,"abstract":"We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree /spl Delta/. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 /spl Delta/.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"240","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFFCS.1999.814577","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 240
Abstract
We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree /spl Delta/. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 /spl Delta/.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
