Equitable matroids
The electronic journal of combinatorics, Tome 13 (2006)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate the class of matroids having the property that this procedure yields a basis uniformly at random. We show how this class is related to some other naturally-defined families of matroids and consider how it behaves under well-known matroid operations.
Dillon Mayhew. Equitable matroids. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1067
@article{10_37236_1067,
author = {Dillon Mayhew},
title = {Equitable matroids},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1067},
zbl = {1100.05017},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1067/}
}
Cité par Sources :