Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

DOI10.1007/978-3-642-04128-0_56MaRDI QIDQ3639277zbMATH OpenOpenAlexFDO

Authors Markus Bläser, Christian Hoffmann

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_56

zbMATH Keywords

multivariate interlace polynomialtree decomposition

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• Fast evaluation of interlace polynomials on graphs of bounded treewidth
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• Evaluating a weighted graph polynomial for graphs of bounded tree-width
• On the Complexity of the Interlace Polynomial
• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width

Cited in

(6)

• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• Evaluating a weighted graph polynomial for graphs of bounded tree-width
• Complexity and approximability of the cover polynomial
• Fast evaluation of interlace polynomials on graphs of bounded treewidth
• The complexity of the greedoid Tutte polynomial
• Decompositions of graphs of functions and fast iterations of lookup tables

This page was built for publication: Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

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