Articoli correlati a SWAT '90: 2nd Scandinavian Workshop on Algorithm...

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

 
9783540528463: SWAT '90: 2nd Scandinavian Workshop on Algorithm Theory. Bergen, Norway, July 11-14, 1990. Proceedings: 447
Brossura
ISBN 10: 3540528466 ISBN 13: 9783540528463
Casa editrice: Springer, 2008

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2008
Lingua
Inglese
ISBN 10 
3540528466
ISBN 13 
9783540528463
Rilegatura
Copertina flessibile
Numero di pagine
417
Redattore
Gilbert John R., Karlsson Rolf
Contatto del produttore
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Germania