Atjaunināt sīkdatņu piekrišanu

Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings [Mīkstie vāki]

  • Formāts: Paperback / softback, 362 pages, height x width: 235x155 mm, weight: 5679 g, 107 Illustrations, black and white; XIV, 362 p. 107 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8344
  • Izdošanas datums: 03-Feb-2014
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 331904656X
  • ISBN-13: 9783319046563
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 362 pages, height x width: 235x155 mm, weight: 5679 g, 107 Illustrations, black and white; XIV, 362 p. 107 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 8344
  • Izdošanas datums: 03-Feb-2014
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 331904656X
  • ISBN-13: 9783319046563
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.

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

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