Correspondence between two antimatroid algorithmic characterizations
The electronic journal of combinatorics, Tome 10 (2003)
The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great importance.While antimatroids can also be characterized as set systems, the question whether there is an algorithmic description of antimatroids in terms of sets and set functions was open for some period of time.This article provides a selective look at classical material on algorithmic characterization of antimatroids, i.e., the ordered version, and a new unordered version. Moreover we empathize formally the correspondence between these two versions.
@article{10_37236_1737,
author = {Yulia Kempner and Vadim E. Levit},
title = {Correspondence between two antimatroid algorithmic characterizations},
journal = {The electronic journal of combinatorics},
year = {2003},
volume = {10},
doi = {10.37236/1737},
zbl = {1044.90062},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1737/}
}
Yulia Kempner; Vadim E. Levit. Correspondence between two antimatroid algorithmic characterizations. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1737
Cité par Sources :