Series and parallel reductions for the Tutte polynomial

Discrete Mathematics

Volumn 220, Issue 1-3, 2000, Pages 291-297

  Traldi, Lorenzo ^a  

^a LAFAYETTE COLLEGE   (United States)

Author keywords

Computational complexity; Dichromate; Parallel reduction; Reliability domination; Series reduction; Tutte polynomial; invariant

Indexed keywords

EID: 0347646935     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00035-2     Document Type: Article

References (15)

1. T. Brylawski, A combinatorial model for series-parallel networks, Trans. Amer. Math. Soc. 154 (1971) 1-22.
2. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, Oxford, 1987.
3. H.H. Crapo, A higher invariant for matroids, J. Combin. Theory 2 (1967) 406-417.
4. A.B. Huseby, Domination theory and the Crapo β-invariant, Networks 19 (1989) 135-149.
5. F. Jaeger, D.L. Vertigan, D.J.A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc. 108 (1990) 35-53.
6. R. Johnson, Network reliability and acyclic orientations, Networks 14 (1984) 489-505.
7. J.G. Oxley, Matroid Theory, Oxford University Press, Oxford, 1992.
8. J.G. Oxley, D.J.A. Welsh, Tutte polynomials computable in polynomial time, Discrete Math. 109 (1992) 185-192.
9. G.C. Robinson, D.J.A. Welsh, The computational complexity of matroid properties, Math. Proc. Cambridge Philos. Soc. 87 (1980) 29-45.
10. A. Satyanarayana, M.K. Chang, Network reliability and the factoring theorem, Networks 13 (1983) 107-120.
11. P.D. Seymour, Decomposition of regular matroids, J. Combin. Theory Ser. B (1980) 305-359.
12. W.T. Tutte, Graph Theory, Cambridge University Press, Cambridge, 1984.
13. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge, 1993.
14. N. White (Ed.), Theory of Matroids, Cambridge University Press, Cambridge, 1986.
15. N. White (Ed.), Matroid Applications, Cambridge University Press, Cambridge, 1992.