Geodesic
Equitable matroids
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1067
Classification : 05B35, 05A05 
@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/}
}
TY  - JOUR
AU  - Dillon Mayhew
TI  - Equitable matroids
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1067/
DO  - 10.37236/1067
ID  - 10_37236_1067
ER  - 
%0 Journal Article
%A Dillon Mayhew
%T Equitable matroids
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1067/
%R 10.37236/1067
%F 10_37236_1067
Dillon Mayhew. Equitable matroids. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1067

Cité par Sources :