Cantitate/Preț
Produs

Combinatorial Algorithms: 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers: Lecture Notes in Computer Science, cartea 7056

Editat de Costas S. Iliopoulos, William F. Smyth
en Limba Engleză Paperback – 9 ian 2012
This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Victoria, 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.
Citește tot Restrânge

Toate formatele și edițiile

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

Din seria Lecture Notes in Computer Science

Preț: 33868 lei

Preț vechi: 42335 lei
-20% Nou

Puncte Express: 508

Preț estimativ în valută:
6481 6726$ 5417£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642250101
ISBN-10: 3642250106
Pagini: 398
Ilustrații: XI, 387 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.59 kg
Ediția:2012
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ă

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.

Caracteristici

Up-to-date results Fast track conference proceedings State-of-the-art report