Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets.

Published in: DLT (2016)

Keyphrases

series parallel
partially ordered sets
branch and bound
precedence constraints
tree decomposition
temporal reasoning
markov chain
binary trees
branch and bound algorithm
computational complexity
constraint networks
lower bound
bit rate
redundancy allocation