Skip to search formSkip to main contentSkip to account menu

Dual matroid

In matroid theory, the dual of a matroid is another matroid that has the same elements as , and in which a set is independent if and only if has a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B… 
2014
2014
By the augmentation axiom of matroids, given two independent sets whose cardinalities are not equal, there exists some other… 
2013
2013
As an important technique for granular computing, rough sets deal with vagueness and granularity in information systems. Rough… 
2012
2012
We demonstrate that two key theorems of Amaldi et al. (Math Methods Oper Res 69:205–223, 2009), which they presented with rather… 
2012
2012
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces… 
2001
2001
We consider an extension to the optimal matroid base problem [1] whereby the matroid element costs are not fixed, but are time… 
1997
1997
Let M be a finite matroid with rank function r. We will write A ⊆ M when we mean that A is a subset of the ground set of M , and… 
1974
1974
Unified proofs of two theorems on fundamental transversal matroids are presented. A necessary condition for a matroid to be a…