Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture.

Stéphane Bessy Daniel Gonçalves Amadeus Reinald

Published in: CoRR (2024)

Keyphrases

upper bound
decision trees
color images
lower bound
worst case
early vision
error bounds
directed graph
database
tree edit distance
tree construction
markov models
inductive inference
edit distance
color information
tree structure
np hard
training set
image sequences
learning algorithm
genetic algorithm
data sets