Boolean sublattices connected with minimization problems on matroids (Q3922500): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the structure of all minimum cuts in a network and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5532570 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3934401 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matroid intersection algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4166767 / rank | |||
Normal rank | |||
Latest revision as of 12:47, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Boolean sublattices connected with minimization problems on matroids |
scientific article |
Statements
Boolean sublattices connected with minimization problems on matroids (English)
0 references
1982
0 references
Boolean sublattices
0 references
augmenting path algorithm
0 references
Boolean lattice
0 references
Jordan- Hölder theorem
0 references
matroid intersection
0 references
network decomposition
0 references
maximum- flow minimal cut equations
0 references
