ISBN-13: 9783540575030 / Angielski / Miękka / 1993 / 169 str.
This monograph studies the theoretical complexity and practical efficiency of randomized dynamic algorithms.
Fundamental structures.- Static randomized incremental algorithms.- The Delaunay tree.- A general structure: The influence graph.- The k-Delaunay tree.- Towards a fully dynamic structure.- Parallel work.
Czytaj nas na: