Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs
Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 14 September 2020Accepted: 20 August 2021Published online: 05 January 2022KeywordsMarkov chains, coupling from the past, graph colorings, perfect/exact samplingAMS Subject Headings60J10, 60J22Publication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: …