SWAT '90 : 2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings. 1st ed. 1990

種類:

電子ブック

責任表示:

edited by John R. Gilbert, Rolf Karlsson

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1990

著者名:

• Gilbert, John R.
• Karlsson, Rolf.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 447

ISBN:

9783540471646 [3540471642]    

注記:

Structural complexity theory: Recent surprises -- Approximating maximum independent sets by excluding subgraphs -- Generating sparse spanners for weighted graphs -- Finding the k smallest spanning trees -- The file distribution problem for processor networks -- Translating polygons with applications to hidden surface removal -- Output-sensitive generation of the perspective view of isothetic parallelepipeds -- Graphics in flatland revisited -- The visibility diagram: A data structure for visibility problems and motion planning -- Fast updating of well-balanced trees -- How to update a balanced binary tree with a constant number of rotations -- Ranking trees generated by rotations -- Expected behaviour analysis of AVL trees -- Analysis of the expected search cost in skip lists -- Lower bounds for monotonic list labeling -- Sorting shuffled monotone sequences -- A faster parallel algorithm for a matrix searching problem -- A rectilinear steiner minimal tree algorithm for convex point sets -- Finding shortest pa
This volume presents papers from the 2nd Scandinavian Workshop on Algorithm Theory. The contributions describe original research on algorithms and data structures, in all areas, including combinatorics, computational geometry, parallel computing, and graph theory. The majority of the papers focus on the design and complexity analysis of: data structures, text algorithms, and sequential and parallel algorithms for graph problems and for geometric problems. Examples of tech- niques presented include: - efficient ways to find approximation algorithms for the maximum independent set problem and for graph coloring; - exact estimation of the expected search cost for skip lists; - construction of canonical representations of partial 2-trees and partial 3-trees in linear time; - efficient triangulation of planar point sets and convex polygons.

ローカル注記:

学内専用E-BOOKS (local access only)