Cantitate/Preț
Produs

Graph-Theoretic Concepts in Computer Science: 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011, Revised Papers: Lecture Notes in Computer Science, cartea 6986

Editat de Petr Kolman, Jan Kratochvíl
en Limba Engleză Paperback – 2 dec 2011
This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011.The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32432 lei

Preț vechi: 40541 lei
-20% Nou

Puncte Express: 486

Preț estimativ în valută:
6207 6548$ 5173£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642258695
ISBN-10: 3642258697
Pagini: 350
Ilustrații: XI, 344 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.54 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ă

Research

Textul de pe ultima copertă

This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011.
The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.

Caracteristici

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