All interval greedoids on at most 5 elements

Dragan M. Acketa

An algorithm for checking intervality of a greedoid is described. We apply the corresponding computer program to the list of all non-isomorphic greedoids on at most 5 elements, which was obtained in [1]. Greedold denotations in the two papers are in accordance.