scientific article; zbMATH DE number 795115

MaRDI QIDQ4845264zbMATH OpenFDO

Authors D. J. A. Welsh

Publication date 11 September 1995

zbMATH Keywords

invariantsmatroidNP-hardrandomised algorithmsTutte polynomialTutte-Gröthendieck invariants

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• scientific article; zbMATH DE number 952958
• scientific article; zbMATH DE number 1369835
• Inapproximability of the Tutte polynomial
• scientific article; zbMATH DE number 5168339

Cited in

(5)

• Splitting formulas for Tutte polynomials
• On the algebraic complexity of some families of coloured Tutte polynomials
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• scientific article; zbMATH DE number 1369835 (Why is no real title available?)
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case

This page was built for publication:

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