scientific article; zbMATH DE number 795115

zbMATH Open0831.05018MaRDI QIDQ4845264FDOQ4845264

Authors: D. J. A. Welsh 

Publication date: 11 September 1995

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

invariantsmatroidNP-hardTutte polynomialrandomised algorithmsTutte-Gröthendieck invariants

Mathematics Subject Classification ID

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

Cited In (4)

• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• On the algebraic complexity of some families of coloured Tutte polynomials
• Splitting formulas for Tutte polynomials
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width

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)