Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Matroid Applications and Algorithms
View through CrossRef
Matroid theory provides a set of modeling tools with which many combinatorial and algebraic problems may be treated. Generic algorithms for the resulting matroid problems can be used to solve problems from a variety of application areas including engineering, scheduling, mathematics, and mathematical programming. In this paper, we give an introduction to matroid theory and algorithms, and a survey of algorithmic applications. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Institute for Operations Research and the Management Sciences (INFORMS)
Title: Matroid Applications and Algorithms
Description:
Matroid theory provides a set of modeling tools with which many combinatorial and algebraic problems may be treated.
Generic algorithms for the resulting matroid problems can be used to solve problems from a variety of application areas including engineering, scheduling, mathematics, and mathematical programming.
In this paper, we give an introduction to matroid theory and algorithms, and a survey of algorithmic applications.
INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Related Results
Parallel algorithms for matroid intersection and matroid parity
Parallel algorithms for matroid intersection and matroid parity
A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic mat...
Topics in matroid union
Topics in matroid union
The operation of matroid union was introduced by Nash-Williams in 1966. A
matroid is indecomposable if it cannot be written in the form M = M1 V
M2, where r(M1),r(M2) > 0. In ...
Covering Cycle Matroid
Covering Cycle Matroid
Covering is a type of widespread data representation while covering-based rough sets provide an efficient and systematic theory to deal with this type of data. Matroids are based o...
Faster Matroid Partition Algorithms
Faster Matroid Partition Algorithms
In the matroid partitioning problem, we are given
\(k\)
matroids
\(\mathcal{M}_{1}=(V,\mathcal{I}_{1}...
Matroids, Cyclic Flats, and Polyhedra
Matroids, Cyclic Flats, and Polyhedra
<p>Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining them. A common feature of these is that they are able to be efficiently ...
On Density-Critical Matroids
On Density-Critical Matroids
For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper min...
On analogs of Cremona automorphisms for matroid fans
On analogs of Cremona automorphisms for matroid fans
Matroids are combinatorial objects that generalize linear independence. A matroid can be represented geometrically by its Bergman fan and we compare the symmetries of these two obj...
K-Regular Matroids
K-Regular Matroids
<p>The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF(2) is the class...