A Sharp Upper Bound for the Complexity of Labeled Oriented Trees

Moritz Christmann, Timo de Wolff

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial…