Efficient schemes for nearest neighbor l
โ
Ralf Diekmann; Andreas Frommer; Burkhard Monien
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 282 KB
We design a general mathematical framework to analyze the properties of nearest neighbor balancing algorithms of the diusion type. Within this framework we develop a new Optimal Polynomial Scheme (OPS) which we show to terminate within a ยฎnite number m of steps, where m only depends on the graph and