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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065389185 / rank
 
Normal rank
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 04: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
    0 references
    0 references
    0 references
    0 references
    0 references
    bipartite graphs
    0 references
    perfect matchings
    0 references
    maximum matchings
    0 references
    maximally-matchable edges
    0 references
    0 references