Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs

Magnus Bordewich, Martin E. Dyer, Marek Karpinski. Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs. Electronic Colloquium on Computational Complexity (ECCC), (002), 2005. [doi]

@article{ECCC-TR05-002,
  title = {Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs},
  author = {Magnus Bordewich and Martin E. Dyer and Marek Karpinski},
  year = {2005},
  url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-002/index.html},
  tags = {e-science},
  researchr = {https://researchr.org/publication/ECCC-TR05-002},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  number = {002},
}