Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
2006 | Electr. J. Comb. | Journal |
Volume | Issue | Citations |
13 | 1 | 0 |
PageRank | References | Authors |
0.34 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dillon Mayhew | 1 | 102 | 18.63 |