Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,217,331 papers from all fields of science
Search
Sign In
Create Free Account
Matroid oracle
In mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Algorithm
Bicircular matroid
Binary matroid
Black box group
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Faster Algorithms for Security Games on Matroids
Mourad Baïou
,
F. Barahona
Algorithmica
2018
Corpus ID: 49294326
Given a matroid M defined by an independence oracle on a ground set E, the Matroid Base Game is played by two players: the…
Expand
2017
2017
The Facets of the Bases Polytope of a Matroid and Two Consequences
Brahim Chaourar
arXiv.org
2017
Corpus ID: 15779351
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…
Expand
2016
2016
The optimality of Dantzig estimator for estimating low rank density matrices ∗
Dong Xia
2016
Corpus ID: 15876275
The famous Dantzig estimator(DE) has been applied in quantum state tomography for estimating an unknown low rank density matrix…
Expand
2013
2013
Constructive approaches to the rigidity of frameworks
V. Nguyen
2013
Corpus ID: 29146014
La theorie de la rigidite etudie l'unicite des realisations des graphes, i.e., des charpentes. Initialement motivee par l…
Expand
2013
2013
The Complexity of Deletion Problems for Matroids
Michael Snook
SIAM Journal on Discrete Mathematics
2013
Corpus ID: 26989120
A matroid property is a class of matroids that is closed under isomorphism. The matroid $\pi$ deletion problem is as follows…
Expand
2010
2010
Cs 598csc: Combinatorial Optimization 1 Maximum Weight Independent Set in a Matroid, Greedy Algo- Rithm, Independence and Base Polytopes 1.1 More on Matroids 1.2 Operations on a Matroid
Chandra Chekuri Scribe
2010
Corpus ID: 50425223
We saw the definition of base, circuit, rank, span and flat of matroids last lecture. We begin this lecture by studying some more…
Expand
2009
2009
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT
A. Frank
,
J. V. Vate
,
F. Glover
2009
Corpus ID: 67839231
An efficient cost scaling algorithm is presented for the independent assignment problem of Iri and Tomizawa, which is equivalent…
Expand
1994
1994
Learning binary matroid ports
L. Hellerstein
,
Collette R. Coullard
ACM-SIAM Symposium on Discrete Algorithms
1994
Corpus ID: 12563099
Given a binary matroid M specified by a port oracle, we can in polynomial number of calls to the oracle construct a binary…
Expand
1993
1993
Recognizing Polymatroids Associated with Hypergraphs
D. Vertigan
,
G. Whittle
Combinatorics, probability & computing
1993
Corpus ID: 35316999
Two natural classes of polymatroids can be associated with hypergraphs: the so-called Boolean and hypergraphic polymatroids…
Expand
1981
1981
Detecting Matroid Minors
P. Seymour
,
P. Walton
1981
Corpus ID: 16275552
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required