The computational complexity of tutte invariants for planar graphs

SIAM Journal on Computing

Volumn 35, Issue 3, 2005, Pages 690-712

  Vertigan, Dirk ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

p complete; Computational complexity; Enumeration; Knot polynomials; Percolation; Planar graphs; Polynomial time; Potts model; Reliability; Tutte polynomial

Indexed keywords

PLANAR GRAPHS; TUTTE INVARIANTS; TUTTE POLYNOMIALS;

COMPUTATION THEORY; GRAPH THEORY; INVARIANCE; POLYNOMIALS; PROBLEM SOLVING;

COMPUTATIONAL COMPLEXITY;

EID: 33745454767     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704446797     Document Type: Article

References (23)

1. T. BRYLAWSKI, The Tutte polynomial. I. General theory, in Matroid Theory and its Applications, Liguori, Naples, Italy, 1982, pp. 125-275.
2. T. H. BRYLAWSKI, A decomposition for combinatorial geometries, Trans. Amer. Math. Soc., 171 (1972), pp. 235-282.
3. H. H. CRAPO, The Tutte polynomial, Aequationes Math., 3 (1969), pp. 211-229.
4. M. E. FISHER, On the Dimer solution of planar Ising models, J. Math. Phys., 7 (1966), pp. 1776-1781.
5. M. R. GAREY AND D. S. JOHNSON, Computers and intractability. A Guide to the Theory of NP-completeness, A Series of Books in the Mathematical Sciences, W. H. Freeman, San Francisco, 1979.
6. M. GRöTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics: Study and Research Texts 2, Springer-Verlag, Berlin, 1988.
7. F. JAEGER, Tutte polynomials and link polynomials, Proc. Amer. Math. Soc., 103 (1988), pp. 647-654.
8. F. JAEGER, D. L. VERTIGAN, AND D. J. A. WELSH, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc., 108 (1990), pp. 35-53.
9. M. JERRUM, Two-dimensional Monomer-Dimer systems are computationally intractable, J. Statist. Phys., 48 (1987), pp. 121-134.
10. M. JERRUM, private communication, 1989.
11. P. W. KASTELEYN, Graph theory and crystal physics, in Graph Theory and Theoretical Physics, Academic Press, London, 1967, pp. 43-110.
12. J. G. OXLEY, Matroid Theory, Oxford Science Publications, The Clarendon Press, Oxford University Press, New York, 1992.
13. J. S. PROVAN, The complexity of reliability computations in planar and acyclic graphs, SIAM J. Comput., 15 (1986), pp. 694-702.
14. M. B. THISTLETHWAITE, A spanning tree expansion of the Jones polynomial, Topology, 26 (1987), pp. 297-309.
15. W. T. TUTTE, A ring in graph theory, Proc. Cambridge Philos. Soc., 43 (1947), pp. 26-40.
16. L. G. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.
17. D. VERTIGAN, The Computational Complexity of Tutte, Jones, Hornfly, and Kauffman Invariants, DPhil thesis, Oxford University, Oxford, England, 1991.
18. D. VERTIGAN, Bicycle dimension and special points of the Tutte polynomial, J. Combin. Theory Ser. B, 74 (1998), pp. 378-396.
19. D. VERTIGAN, The Computational Complexity of Homfly and Kauffman Invariants for Links, manuscript.
20. D. VERTIGAN, The Computational Complexity of Tutte Invariants for Cubic Planar Graphs, manuscript.
21. D. J. A. WELSH, Matroid Theory, London Math. Soc. Monogr. 8, Academic Press [Harcourt Brace Jovanovich], London, 1976.
22. D. J. A. WELSH, Complexity: Knots, Colourings and Counting, London Math. Soc. Lecture Note Ser. 186, Cambridge University Press, Cambridge, UK, 1993.
23. H. WHITNEY, A logical expansion in mathematics, Bull. Amer. Math. Soc., 38 (1932), pp. 572-579.