Strict matching matroids and matroid algorithms (Q3744174): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q126249411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Tutte's 1-factor theorem to countable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Edmonds-Gallai decomposition for matchings in locally finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gammoids and transversal matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dependence graph for bases in matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF STRICT MATCHING MATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized column incidence graph and a matroid base-listing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full transversal matroids, strict gammoids, and the matroid components problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 16:36, 17 June 2024

scientific article
Language Label Description Also known as
English
Strict matching matroids and matroid algorithms
scientific article

    Statements

    Identifiers