On the Number of Eulerian Orientations of a Graph

Algorithmica (New York)

Volumn 16, Issue 4-5, 1996, Pages 402-414

  Mihail, M ^a   Winkler, P ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Eulerian graphs; Eulerian orientations; Monotonicity Lemma; Near perfect matchings; Perfect matchings

Indexed keywords

EID: 0001608278     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01940872     Document Type: Article

References (14)

1. A. Z. Broder, How Hard Is It To Marry at Random? (On the Approximation of the Permanent), Proc. STOC, 1986, pp. 50-58.
2. P. Dagum and M. Luby, Approximating the Permanent of Graphs with Large Factors, SIAM J. Comput., to appear.
3. P. Dagum, M. Luby, M. Mihail, and U. Vazirani, Polytopes, Permanents, and Graphs with Large Factors, Proc. FOCS, 1988, pp. 412-421.
4. P. Diaconis and D. Strock, Geometric Bounds for Eigenvalues of Markov Chains, Ann. Appl. Probab., 1 (1991), 36-61.
5. F. Jaeger, D. L. Vertigan, and D. J. A. Welsh, On the Computational Complexity of Jones and Tutte Polynomials, Math. Proc. Cambridge Philos. Soc., 108(35) (1990), 35-53.
6. M. R. Jerrum, 2 Dimensional Monomer-Dimer Systems are Computationally Intractable, J. Statist. Phis., 48, 121-134.
7. M. R. Jerrum and A. Sinclair, Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved, Proc. STOC, 1988, pp. 235-243.
8. M. R. Jerrum and A. Sinclair, Fast Uniform Generation of Regular Graphs, ICALP Proceedings, 1989.
9. M. R. Jerrum and A. Sinclair, Polynomial-Time Approximation Algorithms for the king Model, Tech. Report, University of Edinburgh, 1990.
10. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani, Random Generation of Combinatorial Structures from a Uniform Distribution, Theoret. Comput. Sci., 43 (1986), 169-188.
11. W. T. Tutte, Graph Theory, Encyclopedia of Mathematics and Its Applications, Vol. 21, Addison-Wesley, Reading, MA.
12. L. G. Valiant, The Complexity of Computing the Permanent, Theoret. Comput. Sci., (1979), 189-201.
13. D. J. A. Welsh, On the Tutte Map, Lecture Notes, DIMACS, May 1991/Dagstuhl, June 1991.
14. D. J. A. Welsh, The Computational Complexity of Some Classical Problems from Statistical Physics, in Disorder in Physical Systems, Oxford University Press, Oxford, 1990, pp. 307-321.