Improved lower bounds on parity vertex colourings of binary trees.

Published in: CoRR (2019)

Keyphrases

binary trees
lower bound
upper bound
objective function
worst case
series parallel
np hard
combinatorial optimization
directed graph
branch and bound algorithm