๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Series-parallel posets and the Tutte polynomial

โœ Scribed by Gary Gordon

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
912 KB
Volume
158
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Tutte polynomial
The Tutte polynomial
โœ Dominic Welsh ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB

This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence

Generalized activities and the tutte pol
Generalized activities and the tutte polynomial
โœ Gary Gordon; Lorenzo Traldi ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 621 KB

The notion of activities with respect to spanning trees in graphs was introduced by W.T. Tutte, and generalized to activities with respect to bases in matroids by H. Crapo. We present a further generalization, to activities with respect to arbitrary subsets of matroids. These generalized activities

Bicycle Dimension and Special Points of
Bicycle Dimension and Special Points of the Tutte Polynomial
โœ Dirk Vertigan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 308 KB

For each pair of algebraic numbers (x, y) and each field F, the complexity of computing the Tutte polynomial T(M; x, y) of a matroid M representable over F is determined. This computation is found to be \*P-complete except when (x&1)( y&1)=1 or when |F| divides (x&1)( y&1) and (x, y) is one of the s

The most reliable series-parallel networ
The most reliable series-parallel networks
โœ Eric M. Neufeld; Charles J. Colbourn ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 333 KB