Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,343 papers from all fields of science
Search
Sign In
Create Free Account
Matroid
Known as:
Frame matroid
, Hereditary property (matroid)
, Simple matroid
Expand
In combinatorics, a branch of mathematics, a matroid /ˈmeɪtrɔɪd/ is a structure that captures and generalizes the notion of linear independence in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Antimatroid
Arthur Hobbs (mathematician)
Basis (linear algebra)
Bicircular matroid
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Oriented Matroids
Jürgen Richter-Gebert
,
Günter M. Ziegler
Handbook of Discrete and Computational Geometry…
2017
Corpus ID: 203027051
The theory of oriented matroids provides a broad setting in which to model, describe, and analyze combinatorial properties of…
Expand
Highly Cited
2016
Highly Cited
2016
Combinatorial Optimization Networks And Matroids
Nicole Fassbinder
2016
Corpus ID: 63123250
combinatorial optimization networks and matroids is available in our digital library an online access to it is set as public so…
Expand
Highly Cited
2001
Highly Cited
2001
Submodular Functions, Matroids, and Certain Polyhedra
J. Edmonds
Combinatorial Optimization
2001
Corpus ID: 14909675
The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another…
Expand
Review
2000
Review
2000
Matrices and Matroids for Systems Analysis
K. Murota
2000
Corpus ID: 118318764
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique…
Expand
Highly Cited
1992
Highly Cited
1992
Matroid theory
J. Oxley
1992
Corpus ID: 8808097
The comments below apply to all printings of the book dated 2005 or earlier. The table following contains more than just a list…
Expand
Highly Cited
1991
Highly Cited
1991
A matroid approach to finding edge connectivity and packing arborescences
H. Gabow
Symposium on the Theory of Computing
1991
Corpus ID: 13384491
We present an algorithm that finds the edge connectivity ? of a graph having n vectices and m edges. The running time is O(? m…
Expand
Highly Cited
1978
Highly Cited
1978
Oriented matroids
J. Folkman
,
J. Lawrence
Journal of combinatorial theory. Series B (Print)
1978
Corpus ID: 2880298
Highly Cited
1965
Highly Cited
1965
Minimum partition of a matroid into independent subsets
J. Edmonds
1965
Corpus ID: 17661186
A matroid M is a finite se t M of e le me nts with a famil y of subsets, called independent, such th a t (I) every subset of an…
Expand
Highly Cited
1965
Highly Cited
1965
Transversals and Matroid Partition
J. Edmonds
,
D. R. Fulkerson
1965
Corpus ID: 15449221
Abstract : A matroid M = (E, F) is a finite set E of elements and a family F of subsets of E, called independent sets, such that…
Expand
Highly Cited
1941
Highly Cited
1941
The colorimetric determination of lactic acid in biological material.
S. B. Barker
,
W. H. Summerson
1941
Corpus ID: 41171153
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