tutte_bhkk

MaRDI QIDQ1334103swMATHFDO

Official website https://arxiv.org/abs/0711.2585

Source code repository https://github.com/thorehusfeldt/tutte_bhkk

Cited in

(11)

• tuttepol
• tutte
• Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
• Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
• Algorithmic Pirogov-Sinai theory
• Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
• The exponential time complexity of computing the probability that a graph is connected
• Parallel family trees for transfer matrices in the Potts model
• Complexity and approximability of the cover polynomial
• Computational resources
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions

This page was built for software: tutte_bhkk