Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Sparsity: Graphs, Structures, and Algorithms - Jaroslav Ne¿et¿il,Patrice Ossona de Mendez

Anglų
2012-04-25
114,33 € 152,44 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 17-23 d.d.

30 dienų grąžinimo politika

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants. This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms. Jaroslav Ne¿et¿il is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris. This book is related to the material presented by the first author at ICM 2010.

Daugiau informacijos

Autorius Jaroslav Ne¿et¿il, Patrice Ossona de Mendez
Leidėjas Springer Berlin Heidelberg
Series Algorithms and Combinatorics
Išleidimo metai 2012
Viršelio tipas Kieti viršeliai
EAN 9783642278747
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Sparsity: Graphs, Structures, and Algorithms
Jūsų įvertinimas:

Goodreads Atsiliepimai

114,33 € 152,44 €