On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
From MaRDI portal
Publication:5479032
DOI10.1017/S0963548305007327zbMath1094.05013MaRDI QIDQ5479032
Publication date: 6 July 2006
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548305007327
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Approximately counting bases of bicircular matroids, Complexity and approximability of the cover polynomial, Distributive lattices, polyhedra, and generalized flows