Computing the Tutte polynomial of a graph of moderate size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1004, Issue , 1995, Pages 224-233

  Sekine, Kyoko ^a   Imai, Hiroshi ^a   Tani, Seiichiro ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

BELL NUMBER; CATALAN NUMBER; EXPONENTIAL TIME; LATTICE GRAPHS; PLANAR GRAPH; TUTTE POLYNOMIAL;

GRAPH THEORY;

EID: 84955560599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0015427     Document Type: Conference Paper

References (10)

1. S. B. Akers: Binary Decision Diagrams. IEEE Trans. on Computers, Vo1.C-27(1978), pp. 509-516.
2. N. Alon, A. Frieze and D. J. A. Welsh: Polynomial Time Randomised Approximation Schemes for the Tutte Polynomial of Dense Graphs. Proceedings of the IEEE Annual Symposium on Foundations of Computer Science, 1994, pp. 24-35.
3. R. E. Bryant: Graph Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Computers, Vol.C-35(1986), pp. 677-691.
4. D. R. Karger. A Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability Problem. Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 11-17.
5. A. Shioura, A. Tamura and T. Uno: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. SIAM Journal on Computing, to appear.
6. S. Tani: An Extended Framework of Ordered Binary Decision Diagrams for Combinatorial Graph Problems. Master’s Thesis, Department of Information Science, University of Tokyo, 1995.
7. M. B. Thistlethwaite: A Spanning Tree Expansion of the Jones Polynomial. Topology, Vol.26 (1987), pp. 297-309.
8. W. T. Tutte: A Contribution to the Theory of Chromatic Polynomials. Canadian Journal of Mathematics, Vol.6 (1954), pp.80-91.
9. D. J. A. Welsh: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Note Series, Vo1.186, Cambridge University Press, 1993.
10. H. S. Wilf: Algorithms and Complexity. Prentice-Hall, 1986.