Matroids and the greedy algorithm (Q5668601): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Independence Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Abstract Properties of Linear Dependence / rank
 
Normal rank

Revision as of 11:22, 12 June 2024

scientific article; zbMATH DE number 3400659
Language Label Description Also known as
English
Matroids and the greedy algorithm
scientific article; zbMATH DE number 3400659

    Statements

    Identifiers