Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (Q387819): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all maximally-matchable edges in a bipartite graph / rank
 
Normal rank

Latest revision as of 03:40, 7 July 2024

scientific article
Language Label Description Also known as
English
Addendum to ``Finding all maximally-matchable edges in a bipartite graph''
scientific article

    Statements

    Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (English)
    0 references
    0 references
    17 December 2013
    0 references
    bipartite graphs
    0 references
    perfect matchings
    0 references
    maximum matchings
    0 references
    maximally-matchable edges
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references