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

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/mp/Edmonds71, #quickstatements; #temporary_batch_1731483406851
 
(2 intermediate revisions by 2 users not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01584082 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991528957 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/Edmonds71 / rank
 
Normal rank

Latest revision as of 09:29, 13 November 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