Matroid partitioning
id:
matroid-partitioning-270-13181316
title:
Matroid partitioning
text:
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 m
brand slug:
wiki
category slug:
encyclopedia
description:
Subdivision into few independent sets
original url:
https://en.wikipedia.org/wiki/Matroid_partitioning
date created:
date modified:
2023-03-20T20:31:33Z
main entity:
{"identifier":"Q6787906","url":"https://www.wikidata.org/entity/Q6787906"}
image:
fields total:
13
integrity:
14