SWAT '88: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings: 318 - Brossura

Karlsson, Rolf; Lingas, Andrzej

Brossura

ISBN 10: 3540194878 ISBN 13: 9783540194873

Casa editrice: Springer, 2008

Riassunto

The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.

Su questo libro

Contenuti

An implicit binomial queue with constant insertion time.- Implicit selection.- An extrapolation on the interpolation search.- Time parameter and arbitrary deunions in the set union problem.- Two new algorithms for constructing min-max heaps.- Extremal cost tree data structures.- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques.- Problems of posting sentries: Variations on the art gallery theorem.- A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons.- On recognizing and characterizing visibility graphs of simple polygons.- Connectability problems.- Two hybrid methods for collision resolution in open addressing hashing.- On an alternative sum useful in the analysis of some data structures.- Bin-packing in 1.5 dimension.- Applications of a symbolic perturbation scheme.- A fast parallel algorithm for computing all maximal cliques in a graph and the related problems.- Parallel solution of sparse linear systems.- A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors.- Probabilistic log-space reductions and problems probabilistically hard for p.- Searching with uncertainty extended abstract.- An optimal expected-time parallel algorithm for Voronoi diagrams.- Generating binary trees by transpositions.- Approximating the complete Euclidean graph.- Upper and lower bounds for the dictionary problem.- Linear algorithms for graph separation problems.- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees.- NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems.- Independent covers in outerplanar graphs.- Tight lower bounds for Shellsort.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540194878
• ISBN 13: 9783540194873
• Rilegatura: Copertina flessibile
• Numero di pagine: 272
• Contatto del produttore: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Germania