Fast and Simple Algorithms for Weighted Perfect Matching (Q3439168): 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.1016/j.endm.2004.03.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2802905039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Heuristic for Complete Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252363 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:06, 25 June 2024

scientific article
Language Label Description Also known as
English
Fast and Simple Algorithms for Weighted Perfect Matching
scientific article

    Statements

    Fast and Simple Algorithms for Weighted Perfect Matching (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    weighted matching
    0 references
    approximation algorithms
    0 references

    Identifiers