Efficient algorithms for finding maximum
โ
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