Author:
Vertigan D. L.,Welsh D. J. A.
Abstract
Along different curves and at different points of the (x, y)-plane the Tutte polynomial evaluates a wide range of quantities. Some of these, such as the number of spanning trees of a graph and the partition function of the planar Ising model, can be computed in polynomial time, others are # P-hard. Here we give a complete characterisation of which points and curves are easy/hard in the bipartite case.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference10 articles.
1. Bicycle dimension and special points of the Tutte polynomial.;Vertigan;J. Comb. Th.
2. The computational complexity of Tutte invariants for planar graphs;Vertigan;SIAM J. Comput.
3. The Complexity of Enumeration and Reliability Problems
4. Hard Enumeration Problems in Geometry and Combinatorics
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献