Login / Signup

Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs.

Gordon F. RoyleAlan D. Sokal
Published in: SIAM J. Discret. Math. (2015)
Keyphrases
  • series parallel
  • temporal reasoning
  • binary trees
  • tree decomposition
  • precedence constraints
  • lower bound
  • upper bound
  • worst case
  • constraint networks
  • search algorithm
  • scheduling problem