Alternative algorithms for counting all matchings in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 427-438

  Sankowski, Piotr ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHAINS; GRAPHIC METHODS; HEURISTIC METHODS; IMPORTANCE SAMPLING; MARKOV PROCESSES;

ALTERNATIVE ALGORITHMS; DENSE GRAPHS; EXPONENTIAL TIME; GENERAL GRAPH; MATCHINGS; MATCHINGS IN GRAPHS; RANDOM GRAPHS; RELATIVE ERRORS;

GRAPH THEORY;

EID: 34748860515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_38     Document Type: Article

References (13)

1. Alexander Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures and Algorithms 14 (1999), 29-61.
2. Alexander Barvinok, New Permanent Estimators Via Non-Commutative Determinants, preprint.
3. J. van den Berg and R. Brouwer, Random Sampling for the Monomer-Dimer Model on a Lattice, 1999 CWI Research Report.
4. Isabel Beichl and Francis Sullivan, Approximating the Permanent via Importance Sampling with Application to Dimer Covering Problem, Journal of computational Physics 149, 1, February 1999.
5. Steve Chien, Lars Rasmussen and Alistair Sinclair, Clifford Algebras and Approximating the Permanent, Proceedings of the 34th ACM Symposium on Theory of Computing, 2001, 712-721.
6. A. Frieze and M. Jerrum, An analysis of a Monte Carlo algorithm for estimating the permanent, Combinatorica, 15 (1995), 67-83.
7. C.D. Godsil and I. Gutman, On the matching polynomial of a graph, Algebraic Methods in Graph Theory, Vol. I, II, (Szeged, 1978), North-Holland, Amsterdam - New York, 1981, 241-249.
8. Ole J. Heilmann, Elliott H. Lieb, Theory of Monomer-Dimer Systems, Communications in mathematical Physics 25 (1972), 190-232.
9. Mark Jerrum and Alistair Sinclair, Approximating the permanent, SIAM Journal on Computing 18 (1989), 1149-1178.
10. Mark Jerrum and Alistair Sinclair, The Markow Chain Monte Carlo method: an approach to approximate counting and integration, in Approximation Algorithms for NP-hard Problems (Dorit Hochbaum, ed.), PWS 1996.
11. Mark Jerrum, Alistair Sinclair and Eric Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, Electronic Colloquium on Computational Complexity, Report No. 79 (2000).
12. N. Karmarkar, R. Karp, R. Lipton, L. Lovász and M. Luby, A Monte Carlo algorithm for estimating the permanent, SIAM Journal on Computing 22 (1993), 284-293.
13. Lars Eilstrup Rasmussen, Approximating the Permanent: a Simple Approach, Random Structures Algorithms 5 (1994), 349-361.