Skip to search formSkip to main contentSkip to account menu

Matroid

Known as: Frame matroid, Hereditary property (matroid), Simple matroid 
In combinatorics, a branch of mathematics, a matroid /ˈmeɪtrɔɪd/ is a structure that captures and generalizes the notion of linear independence in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
The theory of oriented matroids provides a broad setting in which to model, describe, and analyze combinatorial properties of… 
Highly Cited
2016
Highly Cited
2016
combinatorial optimization networks and matroids is available in our digital library an online access to it is set as public so… 
Highly Cited
2001
Highly Cited
2001
The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another… 
Review
2000
Review
2000
A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique… 
Highly Cited
1992
Highly Cited
1992
The comments below apply to all printings of the book dated 2005 or earlier. The table following contains more than just a list… 
Highly Cited
1991
Highly Cited
1991
We present an algorithm that finds the edge connectivity ? of a graph having n vectices and m edges. The running time is O(? m… 
Highly Cited
1978
Highly Cited
1978
Highly Cited
1965
Highly Cited
1965
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… 
Highly Cited
1965
Highly Cited
1965
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…