Cantitate/Preț
Produs

Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8344

Editat de Sudebkumar Prasant Pal, Kunihiko Sadakane
en Limba Engleză Paperback – 3 feb 2014
This book constitutes the revised selected papers of the 8th International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014. The 29 full papers presented together with 3 invited talks were carefully reviewed and selected from 62 submissions. The papers are organized in topical sections on computational geometry, algorithms and approximations, distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33635 lei

Preț vechi: 42043 lei
-20% Nou

Puncte Express: 505

Preț estimativ în valută:
6437 6641$ 5448£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319046563
ISBN-10: 331904656X
Pagini: 376
Ilustrații: XIV, 362 p. 107 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.53 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Computational Geometry.- Algorithms and Approximations.- Distributed Computing and Networks.- Graph Algorithms.- Complexity and Bounds.- Graph Embeddings and Drawings.

Textul de pe ultima copertă

This book constitutes the revised selected papers of the 8th
International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014.
The 29 full papers presented together with 3 invited talks were
carefully reviewed and selected from 62 submissions. The papers are
organized in topical sections on computational geometry, algorithms and approximations, distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings.