scientific article; zbMATH DE number 2019624
From MaRDI portal
Publication:4440427
zbMath1028.68098MaRDI QIDQ4440427
Martin Dyer, Leslie Ann Goldberg, Mark R. Jerrum
Publication date: 17 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830051.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (2)
Algorithms to approximately count and sample conforming colorings of graphs ⋮ The complexity of partition functions
This page was built for publication:
