mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial structure...

the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are...

(i.e., as a random oracle). Black box group Turing reduction Interactive proof system Matroid oracle Demand oracle Padding oracle attack Adachi 1990,...

whether a given matroid is uniform, given access to the matroid via an independence oracle, must perform an exponential number of oracle queries, and therefore...

oracle model. Applications of matroid parity algorithms include finding large planar subgraphs and finding graph embeddings of maximum genus. Matroid...

Matroid partitioning may be solved in polynomial time, given an independence oracle for the matroid. It may be generalized to show that a matroid sum...

of matroids, a minor of a matroid M is another matroid N that is obtained from M by a sequence of restriction and contraction operations. Matroid minors...

In matroid theory, the dual of a matroid M {\displaystyle M} is another matroid M ∗ {\displaystyle M^{\ast }} that has the same elements as M {\displaystyle...

Matroid, Inc. is a computer vision company that offers a platform for creating computer vision models, called detectors, to search visual media for objects...

In matroid theory, a mathematical discipline, the girth of a matroid is the size of its smallest circuit or dependent set. The cogirth of a matroid is...

In the mathematical theory of matroids, a graphic matroid (also called a cycle matroid or polygon matroid) is a matroid whose independent sets are the...

matroid theory, a binary matroid is a matroid that can be represented over the finite field GF(2). That is, up to isomorphism, they are the matroids whose...

theory of matroids, the rank of a matroid is the maximum size of an independent set in the matroid. The rank of a subset S of elements of the matroid is, similarly...

In mathematics, a bipartite matroid is a matroid all of whose circuits have even size. A uniform matroid U n r {\displaystyle U{}_{n}^{r}} is bipartite...

In mathematics, a regular matroid is a matroid that can be represented over all fields. A matroid is defined to be a family of subsets of a finite set...

In matroid theory, an Eulerian matroid is a matroid whose elements can be partitioned into a collection of disjoint circuits. In a uniform matroid U n...

In mathematics, the Vámos matroid or Vámos cube is a matroid over a set of eight elements that cannot be represented as a matrix over any field. It is...

group, an implicit model for group-theoretic algorithms Matroid oracle, an implicit model for matroid algorithms Korf, Richard E. (2008), "Linear-time disk-based...

black box group is equipped with a further oracle for determining element orders. Implicit graph Matroid oracle Babai, L.; Szemeredi, E. (1984). "On the...

matroid constraint, ensuring that each item is allocated to at most one agent. Another way to access the agents' utilities is using a demand oracle (an...

matroid is a matroid endowed with a function that assigns a weight to each element. Formally, let M = ( E , I ) {\displaystyle M=(E,I)} be a matroid,...

Intersection of two partition matroids - 6.75 Intersection of a graphic matroid and a partition matroid - 10.66 General matroid with matroid rank k {\displaystyle...

the matroids with branchwidth at most k can be recognized in polynomial time by an algorithm that has access to the matroid via an independence oracle. By...

vector. Matroid rank functions Let Ω = { e 1 , e 2 , … , e n } {\displaystyle \Omega =\{e_{1},e_{2},\dots ,e_{n}\}} be the ground set on which a matroid is...

may be found in polynomial time given access to an independence oracle for the matroid (Coullard & Hellerstein 1996). Bang-Jensen, Jørgen; Gutin, Gregory...

a bit-length which is not polynomial in this representation. Oriented matroid Nef polyhedron Steinitz's theorem for convex polyhedra Branko Grünbaum...

supply constraints given as an independence system over the items, such as matroid constraints. They focus on unit-demand buyers. Chen and Deng study multi-item...

A. Harvey (MIT) "Algebraic Structures and Algorithms for Matching and Matroid Problems" 2005 Mark Braverman (Toronto) "On the Complexity of Real Functions"...

guarantee, that works for the more general problem of allocating a basis of a matroid. Li, Moulin, Sun and Zhou have extended Hill's lower bound to bads, and...