Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
From MaRDI portal
Publication:5426882
DOI10.1137/050645208zbMath1126.05092OpenAlexW3021394452MaRDI QIDQ5426882
Marc Noy, Petr Hliněný, Omer Giménez
Publication date: 16 November 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050645208
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Complexity of Ising Polynomials ⋮ Graph classes with and without powers of bounded clique-width ⋮ Latency-bounded target set selection in social networks ⋮ A little statistical mechanics for the graph theorist ⋮ FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES