Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
From MaRDI portal
Publication:4228207
DOI10.1017/S0963548398003551zbMath0917.05072OpenAlexW2156361153WikidataQ128379250 ScholiaQ128379250MaRDI QIDQ4228207
Publication date: 2 February 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003551
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (24)
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings ⋮ FPT algorithms to enumerate and count acyclic and totally cyclic orientations ⋮ Jones polynomial of knots formed by repeated tangle replacement operations ⋮ Complexity of Ising Polynomials ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Farrell polynomials on graphs of bounded tree width ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Complexity and approximability of the cover polynomial ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ On the algebraic complexity of some families of coloured Tutte polynomials ⋮ The Potts model and the Tutte polynomial ⋮ Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width ⋮ Counting truth assignments of formulas of bounded tree-width or clique-width ⋮ Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width ⋮ A little statistical mechanics for the graph theorist ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ On the colored Tutte polynomial of a graph of bounded treewidth ⋮ FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ Spanning tree constrained determinantal point processes are hard to (approximately) evaluate ⋮ An algorithm for the Tutte polynomials of graphs of bounded treewidth ⋮ Parameterized counting problems ⋮ Forests, colorings and acyclic orientations of the square lattice
This page was built for publication: Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
