Perfect matchings and extended polymatroid (Q946789): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s10559-008-9013-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015524385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics on assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Methods for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cut problem using bases of extended polymatroids / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:41, 28 June 2024

scientific article
Language Label Description Also known as
English
Perfect matchings and extended polymatroid
scientific article

    Statements

    Perfect matchings and extended polymatroid (English)
    0 references
    0 references
    24 September 2008
    0 references
    perfect matching
    0 references
    bipartite graph
    0 references
    extended polymatroid
    0 references

    Identifiers