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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2013.03.015 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6238870 / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite graphs
Property / zbMATH Keywords: bipartite graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matchings
Property / zbMATH Keywords: perfect matchings / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum matchings
Property / zbMATH Keywords: maximum matchings / rank
 
Normal rank
Property / zbMATH Keywords
 
maximally-matchable edges
Property / zbMATH Keywords: maximally-matchable edges / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2013.03.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 9 December 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