Login / Signup
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.
Janka Chlebíková
Clément Dallard
Published in:
IWOCA (2019)
Keyphrases
</>
planar graphs
decision problems
worst case
maximum likelihood
binary variables
vertex cover
bayesian networks