Efficient many-to-Many point matching in one dimension (Q2373930): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126274371, #quickstatements; #temporary_batch_1719271204161
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3145800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing the restriction s|caffold assignment problem in computational biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry helps in bottleneck matching and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance measures for point sets and their computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two special cases of the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for minimum-weight bibranching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Matching Algorithms for Points on a Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Relations for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Musical Rhythm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry Helps in Matching / rank
 
Normal rank

Latest revision as of 11:28, 26 June 2024

scientific article
Language Label Description Also known as
English
Efficient many-to-Many point matching in one dimension
scientific article

    Statements

    Efficient many-to-Many point matching in one dimension (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2007
    0 references
    minimum-cost
    0 references
    matching problem
    0 references
    complexity
    0 references

    Identifiers