✦ LIBER ✦

The complexity of computing the tutte polynomial on transversal matroids

✍ Scribed by Charles J. Colbourn; J. Scott Provan; Dirk Vertigan

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 478 KB
Volume: 15
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01294456

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irreducibility of the Tutte Polynomial o

Irreducibility of the Tutte Polynomial of a Connected Matroid

✍ C. Merino; A. de Mier; M. Noy 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

On coefficients of the Tutte polynomial

✍ John W. Leo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The complexities of the coefficients of

The complexities of the coefficients of the Tutte polynomial

✍ J.D. Annan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 518 KB

On the quasi-transversals of a matroid

✍ Richard A. Brualdi; Amélia Fonseca 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 220 KB

We show that the set of r-quasi-transversals of a matroid, if nonempty, is the set of bases of a matroid. We also give an alternative proof of the known theorem which identifies the conjugate of the rank partition of a matroid.

On the computational complexity of the o

On the computational complexity of the order polynomial

✍ Ulrich Faigle; Rainer Schrader 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 370 KB

On the complexity of computing determina

On the complexity of computing determinants

✍ Erich Kaltofen; Gilles Villard 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 412 KB