Login / Signup

Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width.

Martin Fürer
Published in: LATIN (2010)
Keyphrases
  • tree width
  • tree decomposition
  • structural properties
  • graph theory
  • structured data
  • lower bound
  • constraint networks
  • higher order
  • shortest path