Skip to search formSkip to main contentSkip to account menu

Matroid embedding

In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties: 1… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Greedy algorithmMatroid

Search for papers about Matroid embedding

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)