Matroid partitioning is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms. Its goal is to partition the elements of a matroid into as few independent sets as possible. An example is the problem of computing the arboricity of an undirected graph, the minimum number of forests needed to cover all of its edges. 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 is itself a matroid, to provide an algorithm for computing ranks and independent sets in matroid sums, and to compute the largest common independent set in the intersection of two given matroids.[1]
^Scheinerman, Edward R.; Ullman, Daniel H. (1997), "5. Fractional arboricity and matroid methods", Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons Inc., pp. 99–126, ISBN 0-471-17864-0, MR 1481157.
and 26 Related for: Matroid partitioning information
Matroidpartitioning is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms. Its goal is to partition...
of a matroid. The matroidpartitioning problem is to partition the elements of a matroid into as few independent sets as possible, and the matroid packing...
In mathematics, a partitionmatroid or partitionalmatroid is a matroid that is a direct sum of uniform matroids. It is defined over a base set in which...
two matroids can be solved in polynomial time using matroidpartitioning algorithms. Let G = (U,V,E) be a bipartite graph. One may define a partition matroid...
Feshbach–Fano partitioning Foliation Frequency partition Graph partition Kernel of a function Lamination (topology) Matroidpartitioning Multipartition...
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...
geometric lattices and matroids, this lattice of partitions of a finite set corresponds to a matroid in which the base set of the matroid consists of the atoms...
mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial structure...
each connecting the distinguished vertices, can be represented as a matroidpartitioning problem, which can be solved in polynomial time. Alternatively, it...
In mathematics, a basis of a matroid is a maximal independent set of the matroid—that is, an independent set that is not contained in any other independent...
Balanced number partitioning is a variant of multiway number partitioning in which there are constraints on the number of items allocated to each set...
mathematical theory of matroids, a paving matroid is a matroid in which every circuit has size at least as large as the matroid's rank. In a matroid of rank r {\displaystyle...
special case of a more general matroidpartitioning problem, in which one wishes to express a set of elements of a matroid as a union of a small number...
to binary matroids: a binary matroid is bipartite if and only if its dual matroid is an Eulerian matroid, a matroid that can be partitioned into disjoint...
Not only the structure but also enumerative properties belong to matroid theory. Matroid theory was introduced by Hassler Whitney and studied as a part...
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 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...
theory of matroids, a matroid representation is a family of vectors whose linear independence relation is the same as that of a given matroid. Matroid representations...
In mathematics, a uniform matroid is a matroid in which the independent sets are exactly the sets containing at most r elements, for some fixed integer...
matroid of M. Then Whitney's planarity criterion can be rephrased as stating that the dual matroid of a graphic matroid M is itself a graphic matroid...
are two matroids associated with a signed graph, called the signed-graphic matroid (also called the frame matroid or sometimes bias matroid) and the...
semilattice, there is an analogous matroid-like structure called a semimatroid, which is a generalization of a matroid (and has the same relationship to...
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...
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...
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...
Graphic matroids and partitionmatroids are special cases of linear matroids. In the matroid parity problem, the input consists of a matroid together...
Global Information