Complexity of Graph Polynomials

Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh

Volumn , Issue , 2007, Pages

  Noble, Steven D ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Graph polynomials; Graphs; Matroids; Polynomial time algorithms; Tutte polynomial

Indexed keywords

EID: 84920753205     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198571278.003.0013     Document Type: Chapter

References (51)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).
2. A. Andrzejak, A polynomial-time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth, Discrete Mathematics 190 (1998) 39-54.
3. J. D. Annan, The complexities of the coefficients of the Tutte polynomial, Discrete Applied Mathematics 57 (1995) 93-103.
4. S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k -tree, SIAM Journal of Algebraic and Discrete Methods 8 (1987) 277-284.
5. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial -trees, Discrete Applied Mathematics 23 (1989) 11-24.
6. H. L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica 11 (1993) 1-21.
7. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, 25, (1996) 1305-1317.
8. T. H. Brylawski, The Tutte polynomial, in Matroid Theory and its Applications (A. Barlotti ed.), Naples, CIME: Liguori editore (1982) pp. 125-275.
9. T. H. Brylawski and J. G. Oxley, The Tutte polynomial and its applications, in Matroid applications (N. White ed.), Cambridge University Press, Cambridge (1992) pp. 123-225.
10. C. J. Colbourn, J. S. Provan, and D. Vertigan, The complexity of computing the Tutte polynomial on transversal matroids, Combinatorica 15 (1995) 1-10.
11. J. Edmonds, Systems of distinct representatives and linear algebra, Journal of Research of the National Bureau of Standards Section B 71B (1967) 241-245.
12. G. E. Farr, The complexity of counting colourings of subgraphs of the grid, Combin. Probab. Comput. 15 (2006) 377-383.
13. G. E. Farr, A correlation inequality involving stable sets and chromatic polynomials, J. Combin. Theory Ser. B, 58 (1993) 14-21.
14. E. J. Farrell, On a general class of graph polynomials, J. Combin. Theory Ser. B 26 (1979) 111-122.
15. M. E. Fisher, On the dimer solution of planar Ising models, Journal of Mathematical Physics 7 (1966) 1776-1781.
16. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, New York (1979).
17. O. Giménez and M. Noy, On the complexity of computing the Tutte polynomial of bicircular matroids, Combin. Probab. Comput. 15 (2006) 385-395.
18. P. Hliněný, On some hard problems on matroid spikes, Theory of Computing Systems, to appear.
19. P. Hliněný, The Tutte polynomial for matroids of bounded branch-width, Combin. Probab. Comput. 15 (2006) 397-409.
20. F. Jaeger, D. L. Vertigan, and D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Mathematical Proceedings of the Cambridge Philosophical Society 108/1 (1990) 35-53.
21. M. R. Jerrum, 2-dimensional monomer-dimer systems are computationally intractable, Journal of Statistical Physics 48 (1987) 121-134.
22. M. R. Jerrum, Private communication (2005).
23. P. W. Kasteleyn, Graph theory and crystal physics, in Graph Theory and Theoretical Physics, Academic Press, London (1967) pp. 43-110.
24. D. E. Knuth, The asymptotic number of geometries, J. Combin. Theory Ser. A 17 (1974) 398-401.
25. N. Linial, Hard enumeration problems in geometry and combinatorics, SIAM Journal on Algebraic and Discrete Methods 7 (1986) 331-335.
26. J. A. Makowsky, Coloured Tutte polynomials and Kaufmann brackets for graphs of bounded tree width, Discrete Applied Mathematics 145 (2005) 276-290.
27. J. A. Makowsky, and J. P. Mariño, Farrell polynomials on graphs of bounded tree width, Advances in Applied Mathematics 30 (2003) 160-176, Special issue of FPSAC'01 papers.
28. S. D. Noble, Evaluating a weighted graph polynomial for graphs of bounded tree-width, Submitted.
29. S. D. Noble, Complexity of graph polynomials, Ph.D. thesis, University of Oxford (1997).
30. S. D. Noble, Evaluating the Tutte polynomial for graphs of bounded treewidth, Combinatorics, Probability and Computing 7. (1998) 307-321.
31. S. D. Noble, Evaluating the rank generating function of a graphic - polymatroid, Combin. Probab. Comput. 15 (2006) 449-461.
32. S. D. Noble, and D. J. A. Welsh, A weighted graph polynomial from Vassiliev invariants, Annales de l'institut Fourier 49 (1999) 1057-1087.
33. J. G. Oxley, Matroid Theory, Number 3 in Oxford Graduate Texts in Mathematics, Oxford University Press, Oxford (1992) .
34. J. G. Oxley and D. J. A. Welsh, Tutte polynomials computable in polynomial time, Discrete Mathematics 109 (1992) 185-192.
35. J. G. Oxley, and G. P. Whittle, Tutte invariants for 2- polymatroids, in Graph Structure Theory (N. Robertson and P. D. Seymour, eds.), Number 147 in Contemporary Mathematics (1993) pp. 9-19. AMS.
36. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading MA (1994).
37. J. S. Provan, and M. O. Ball, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM Journal on Computing 12 (1983) 777-788.
38. N. Robertson and P. D. Seymour, Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322.
39. N. Robertson, and P. D. Seymour, Graph minors IV. Tree-width and wellquasi- ordering, J. Combin. Theory Ser. B 48 (1990) 227-254.
40. P. Rosenstiehl, and R. C. Read, On the principal edge tripartition of a graph, Ann Discrete Math. 3 (1978) 195-226.
41. A. D. Sokal, The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, in Surveys in Combinatorics, 2005 (B. S. Webb, ed.), Volume 327 of London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge (2005).
42. L. Traldi, On the colored Tutte polynomial of a graph of bounded treewidth, Discrete Appl. Math. 154 (2006) 1032-1036.
43. W. T. Tutte, A contribution to the theory of chromatic polynomials. Canad. J. Math. 6 (1954) 80-91.
44. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8 (1979) 189-201.
45. D. Vertigan, The computational complexity of Tutte invariants for cubic planar graphs, Unpublished manuscript.
46. D. Vertigan, The computational complexity of Tutte invariants for planar graphs, SIAM Journal of Computing 35 (2006) 690-712.
47. D. Vertigan, Bicycle dimension and special points of the Tutte polynomial, J. Combinatorial Theory Ser. B 74 (1998) 378-396.
48. D. L. Vertigan, On the computational complexity of the Tutte, Jones, Homfly and Kauffman invariants, PhD. thesis, University of Oxford (1991).
49. D. L. Vertigan, and D. J. A. Welsh, The computational complexity of the Tutte plane: the bipartite case, Combinatorics Probability and Computing 1 (1992) 181-187.
50. D. J. A. Welsh, Matroid Theory, Number 8 in London Mathematical Society Monographs, Academic Press (1976).
51. D. J. A. Welsh, Complexity : Knots, Colourings, and Counting, Number 186 in London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge (1993).