On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids

DOI10.1017/S0963548305007327MaRDI QIDQ5479032zbMATH OpenOpenAlexFDO

Authors Omer Giménez, Marc Noy

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

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Bicycle dimension and special points of the Tutte polynomial
• The Tutte Polynomial for Matroids of Bounded Branch-Width
• The exact complexity of the Tutte polynomial
• Tutte polynomials computable in polynomial time
• The Tutte polynomial of a morphism of matroids. IV: Computational complexity

Cited in

(10)

• Bicycle dimension and special points of the Tutte polynomial
• The Tutte polynomial of a morphism of matroids. IV: Computational complexity
• Complexity and approximability of the cover polynomial
• Approximately counting bases of bicircular matroids
• Distributive lattices, polyhedra, and generalized flows
• Diverse collections in matroids and graphs
• Computational complexity of counting coincidences
• Tutte polynomials computable in polynomial time
• The complexity of the greedoid Tutte polynomial
• Diverse collections in matroids and graphs

This page was built for publication: On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479032)