Titlebook: SWAT ‘88; 1st Scandinavian Wor Rolf Karlsson,Andrzej Lingas Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.R

Chronic

On recognizing and characterizing visibility graphs of simple polygons,In this paper, we establish three necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We also show that visibility graphs of simple polygons do not posses the characteristics of several special classes of graphs.

OTTER

禁令

雜役

978-3-540-19487-3Springer-Verlag Berlin Heidelberg 1988

TIA742

Hallmark

殺子女者

Implicit selection,nt of additional space. We show that this problem can be solved in .(.) time in the worst case. In particular, we show that 6.7756.+.(.) comparisons are sufficient if all elements are distinct and 6.8280.+.(.) comparisons are sufficient in the general case.

形上升才刺激

Extremal cost tree data structures,of the same size. We present our latest results in this area for the classes of AVL trees and brother trees, and for the cost measures based on binary comparisons and node visits. We also briefly consider the space cost measure for brother trees and the unbalance cost measure for AVL trees.

虛弱

Two hybrid methods for collision resolution in open addressing hashing,uce and analyze two hybrid methods, that generalize these basic strategies. The first one uses a probabilistic approach, and the second one uses a “two-phase” strategy, that can be tuned to achieve better performance than FCFS and LCFS.

mortgage

Bin-packing in 1.5 dimension,e are allowed to cut a rectangle and move the parts horizontally. We describe two relatively simple algorithms for this problem and determine their asymptotic performance ratios. For the best algorithm, we show that this ratio is between 1.302... and 4/3.