41 search results - page 3 / 9 » Matroids with nine elements |
123
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
158
click to vote
DM
1998
15 years 3 months ago
1998
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
108
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated...
174
click to vote
ESA
2011
Springer
14 years 4 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
108
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...