Matroid intersection algorithms (Q4077061): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transversals and matroid partition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids and the greedy algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A matroid generalization of a theorem of Mendelsohn and Dulmage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5638342 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Matroid Theorems of Edmonds and Rado / rank | |||
Normal rank |
Revision as of 16:36, 12 June 2024
scientific article; zbMATH DE number 3494150
Language | Label | Description | Also known as |
---|---|---|---|
English | Matroid intersection algorithms |
scientific article; zbMATH DE number 3494150 |
Statements
Matroid intersection algorithms (English)
0 references
1975
0 references