Defining an upper bound K, however, does have a disadvantage: We lose completeness (see van Deemter [2002]).
the algorithm will fail for objects that can be uniquely described only with K + 1 (or more) edges.