Cantitate/Preț
Produs

Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers: Lecture Notes in Computer Science, cartea 6460

Editat de Costas S. Iliopoulos, William F. Smyth
en Limba Engleză Paperback – 16 mar 2011
This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010.
The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32579 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 9 ian 2012 32579 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 16 mar 2011 32736 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32736 lei

Preț vechi: 40920 lei
-20% Nou

Puncte Express: 491

Preț estimativ în valută:
5792 6809$ 5073£

Carte tipărită la comandă

Livrare economică 28 ianuarie-11 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642192210
ISBN-10: 3642192211
Pagini: 432
Ilustrații: XI, 418 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.64 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Professional/practitioner

Caracteristici

High quality selected papers Unique visibility State of the art research

Textul de pe ultima copertă

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Vancouver, BC, Canada, in July 2011.
The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.