๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient Algorithms for Maximum Regression Depth

โœ Scribed by Marc van Kreveld; Joseph S. B. Mitchell; Peter Rousseeuw; Micha Sharir; Jack Snoeyink; Bettina Speckmann

Book ID
106149826
Publisher
Springer
Year
2007
Tongue
English
Weight
523 KB
Volume
39
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Algorithms for k Maximum Sums
Efficient Algorithms for k Maximum Sums
โœ Fredrik Bengtsson; Jingsen Chen ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer ๐ŸŒ English โš– 191 KB
Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc