Matroid

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

Topic mentions per year

Topic mentions per year

1961-2018
05010015019612018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency… (More)
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The <i>index coding</i> problem has recently attracted a significant attention from the research community due to its theoretical… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study a generalization of the classical secretary problem which we call the "matroid secretary problem". In this problem, the… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Let f : 2 → R be a non-decreasing submodular set function, and let (N, I) be a matroid. We consider the problem maxS∈I f(S). It… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We define a class of networks, called matroidal networks, which includes as special cases all scalar-linearly solvable networks… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2001
Highly Cited
2001
I The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another… (More)
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We present an algorithm that finds the edge connect ivity A of a directed graph in time O(Arn log (n2/rn)) and is slightly faster… (More)
Is this relevant?