Computing tutte polynomials

ACM Transactions on Mathematical Software

Volumn 37, Issue 3, 2010, Pages

  Haggard, Gary ^a   Pearce, David J ^b   Royle, Gordon ^c  

^a BUCKNELL UNIVERSITY   (United States)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Chromatic polynomial; Flow polynomial; Graph polynomial; Graph theory; Tutte polynomial

Indexed keywords

CHROMATIC POLYNOMIALS; COMBINATORICS; COMPUTATION TREES; COMPUTATIONAL TOOLS; FLOW POLYNOMIALS; GENERAL GRAPH; GRAPH POLYNOMIALS; PARTIAL EVALUATION; PARTITION FUNCTIONS; POLYNOMIAL GRAPH; POLYNOMIAL INVARIANTS; Q-STATE POTTS MODEL; REAL FLOW; SPANNING TREE; STATISTICAL PHYSICS; TUTTE POLYNOMIAL;

GRAPH THEORY; TREES (MATHEMATICS);

POLYNOMIALS;

EID: 77957551843     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1824801.1824802     Document Type: Article

References (25)

1. BJöRKLUND, A.,HUSFELDT, T.,KASKI, P., AND KOIVISTOR, M.2008a.Computing the Tutte polynomial in vertex-exponential time.In Proceedings of the IEEE Symposium on the Foundations of Computer Science (FOCS).677-686.
2. BJöRKLUND, A., HUSFELDT, T., KASKI, P., AND KOIVISTOR, M.2008b.Computing the Tutte Polynomial in vertex-exponential time.Tech.rep., arxiv.org/PS cache/arxiv/pdf/0711/0711.2585v4.pdf.
3. BOLLOBáS, B.1998.Modern Graph Theory.Graduate Texts in Mathematics, No.184.Springer, New York.
4. BRYLAWSKI, T.AND OXLEY, J.1992.The Tutte polynomial and its applications.In Matroid Applications.Encyclopedia Mathematical Applications, vol.40.Cambridge University Press, Cambridge, UK, 123-225.
5. DENISE, A., VASCONCELLOS, M., AND WELSH, D.J.A.1996.The random planar graph.Congressus Numerantium 113, 61-79.
6. ELLIS-MONAGHAN, J.AND MERINO, C.2009a.Graph polynomials and their applications I: The Tutte Polynomial.In Structural Analysis of Complex Networks.http://arxiv.org/abs/0803.3079.
7. ELLIS-MONAGHAN, J.AND MERINO, C.2009b.Graph polynomials and their applications II: Interrelations and interpretations.In Structural Analysis of Complex Networks.http://arxiv.org/abs/0806.4699.
8. GUTWENGER, C.AND MUTZEL, P.2001.A linear time implementation of SPQR-trees.In Proceedings of the 8th International Symposium on Graph Drawing (GD).Springer-Verlag, 77-90.
9. HAGGARD, G.AND MATHIES, T.1999.The computation of chromatic polynomials.Discr.Math.199, 227-231.
10. HAGGARD, G.AND READ, R.1993.Chromatic polynomials of large graphs II.Isomorphism abstract data type for small graphs.J. Math. Comput.3, 35-43.
11. HALL, D.W., SIRY, J.W., AND VANDERSLICE, B.R.1965.The chromatic polynomial of the truncated icosahedron.Proc.Amer.Math.Soc.16, 4, 620-628.
12. HOPCROFT, J.E.AND TARJAN, R.E.1973.Dividing a graph into triconnected components.SIAM J.Comput.2, 3, 135-158.
13. JAEGER, F., VERTIGAN, D., AND WELSH, D.1990.On the computational complexity of the Jones and Tutte polynomials.Math.Proc.Cambridge Philosoph.Soc.108, 1, 35-53.
14. MCKAY, B.1990.Nauty users guide (version 1.5).Tech.rep., Department of Computer Science, Australian National University.
15. PEARCE, D.J.,HAGGARD, G., AND ROYLE, G.2009.Edge-selection heuristics for computing Tutte Polynomials.In Proceedings of the Computing: The Australasian Theory Symposium (CATS).153-162.
16. PEMMARAJU, S.AND SKIENA, S.2003.Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica.Cambridge University Press, Cambridge, UK.
17. RAUCH, M.1994.Improved data structures for fully dynamic biconnectivity.In Proceedings of the ACM Symposium on Theory of Computing.ACM, 686-695.
18. READ, R.1987.An improved method for computing chromatic polynomials of sparse graphs.Tech.rep.CORR 87-120, University of Waterloo.
19. ROSENSTIEHL, P.AND READ, R.C.1978.On the principal edge tripartition of a graph.Ann.Disc.Math.3, 195-226.Advances in graph theory (Cambridge Combinatorial Conference, Trinity College, Cambridge, 1977).
20. ROYLE, G.F.1988.Computing the Tutte polynomial of sparse graphs.Tech.rep.CORR 88-135, University of Waterloo.
21. SEKINE, K., IMAI, H., AND TANI, S.1995.Computing the Tutte polynomial of a graph of moderate size.Lecture Notes in Computer Science, vol.1004.Springer, 224-233.
22. SOKAL, A.D.2005.The multivariate Tutte polynomial (alias Potts model) for graphs and matroids.In Surveys in Combinatorics.London Mathematics Society.Lecture Note Series, vol.327.Cambridge University Press, Cambridge, UK, 173-226.
23. TARJAN, R.E.1972.Depth-First search and linear graph algorithms.SIAM J.Comput.1, 2, 146-160.
24. TUTTE, W.1954.A contribution to the theory of chromatic polynomials.Canad.J.Math.6, 80-81.
25. WESTBROOK, J.AND TARJAN, R.1992.Maintaining bridge-connected and biconnected components on-line.Algorithmica 7, 1, 433-464.