Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination)

From Algorithm Wiki

Revision as of 11:21, 3 May 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2002

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Duplicate_Elimination_Sorted_Neighborhood_Algorithm_(DE-SNA)_(Duplicate_Elimination_Duplicate_Elimination)&oldid=48034"