Skip to search formSkip to main contentSkip to account menu

Matroid oracle

In mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Given a matroid M defined by an independence oracle on a ground set E, the Matroid Base Game is played by two players: the… 
2017
2017
Let M be a matroid defined on a finite set E and L ⊂ E . L is locked in M if  and  are 2-connected, and . In this paper, we prove… 
2016
2016
The famous Dantzig estimator(DE) has been applied in quantum state tomography for estimating an unknown low rank density matrix… 
2013
2013
La theorie de la rigidite etudie l'unicite des realisations des graphes, i.e., des charpentes. Initialement motivee par l… 
2013
2013
A matroid property is a class of matroids that is closed under isomorphism. The matroid $\pi$ deletion problem is as follows… 
2010
2010
We saw the definition of base, circuit, rank, span and flat of matroids last lecture. We begin this lecture by studying some more… 
2009
2009
An efficient cost scaling algorithm is presented for the independent assignment problem of Iri and Tomizawa, which is equivalent… 
1994
1994
Given a binary matroid M specified by a port oracle, we can in polynomial number of calls to the oracle construct a binary… 
1993
1993
Two natural classes of polymatroids can be associated with hypergraphs: the so-called Boolean and hypergraphic polymatroids… 
1981
1981
When % is a collection of matroids, the question whether M has a minor in % can be easy or hard, depending on the choice of < 6…