Finding all maximally-matchable edges in a bipartite graph (Q418005): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1107.4711 / rank
 
Normal rank

Revision as of 13:28, 18 April 2024

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

    Statements

    Finding all maximally-matchable edges in a bipartite graph (English)
    0 references
    0 references
    14 May 2012
    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
    0 references
    0 references