Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics) - Nesetril, Jaroslav

Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics)

Jaroslav Nesetril

Yayınevi: Springer

Yayın tarihi: 04/2012

ISBN: 9783642278747

Yazar : Patrice Ossona de Mendez

Ciltli | İngilizce | 465 Sayfa | 16,21x24,21x3 cm.

Tür: Matematik-İstatistik

  • Temin Süresi 49 - 63 iş günü

  • ÜYE GİRİŞİ YAPIN

    temin süresi ve fiyatını size bildirelim

  • ÜYE GİRİŞİ YAPIN

    stoklarımıza girdiğinde bilgilendirelim

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šetril 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.

İlgili Ürünler

Bu Türde Çok Satanlar

Kredi Kartına Taksit İmkanı
  • 3 Taksit

  • 3 Taksit

  • 3 Taksit

  • 6 Taksit

©1996-2018 Pandora Yayın ve Kitap Hizmetleri A.Ş.

Mersis No: 0721-0430-4310-0015

Tasarım : Logo Site Tasarımı