On Counting Independent Sets in Sparse Graphs

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 31; no. 5; pp. 1527 - 1541
Main Authors Dyer, Martin, Frieze, Alan, Jerrum, Mark
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 15.08.2002
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph theory
Markov processes
Mathematics
Probability and statistics
Probability theory and stochastic processes
Sciences and techniques of general use
Theoretical computing
Randomised algorithms
Markov chain
Monte Carlo method
Graph degree
Independent set
Approximation algorithm
Combinatorics
Computational complexity
Counting
Online AccessGet full text
ISSN0097-5397
1095-7111
DOI10.1137/S0097539701383844

Cover

More Information
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539701383844