Matroid intersection algorithms (Q4077061): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/mp/Lawler75, #quickstatements; #temporary_batch_1732532539753
 
(2 intermediate revisions by 2 users not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01681329 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054232722 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/Lawler75 / rank
 
Normal rank

Latest revision as of 12:05, 25 November 2024

scientific article; zbMATH DE number 3494150
Language Label Description Also known as
English
Matroid intersection algorithms
scientific article; zbMATH DE number 3494150

    Statements

    Identifiers