Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width
From MaRDI portal
Publication:3557008
DOI10.1007/978-3-642-12200-2_6zbMath1283.05094OpenAlexW2104207136MaRDI QIDQ3557008
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_6
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width