Isbn: 9783642278747 - sparsity: graphs, structures, and algorithms: 28 (6 risultati)

Perfeziona la tua ricerca

  • Libri (6)

  • Nuovo (6)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Springer, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 di 8 - Algorithms and Combinatorics

    • Rilegato

    Da: Books Puddle, Woodside, NY, U.S.A.Books Puddle

    Venditore con 4 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 118,38

    EUR 3,51 spedizione 
    Spedito in U.S.A.

    Quantità: 4 disponibili

    Condizione: New. pp. 484.

  • Lingua: Inglese

    Editore: Springer, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 di 8 - Algorithms and Combinatorics

    • Rilegato

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 137,14

    EUR 35,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 Nesetril 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.…

  • Lingua: Inglese

    Editore: Springer, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 di 8 - Algorithms and Combinatorics

    • Rilegato
    • Print on Demand

    Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 78,24

    EUR 8,00 spedizione 
    Spedito da Italia a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: new. Questo è un articolo print on demand.

  • Lingua: Inglese

    Editore: Springer, Springer Apr 2012, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 di 8 - Algorithms and Combinatorics

    • Rilegato
    • Print on Demand

    Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 96,29

    EUR 23,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 Nesetril 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. 484 pp. Englisch.…

  • Lingua: Inglese

    Editore: Springer Berlin Heidelberg, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 di 8 - Algorithms and Combinatorics

    • Rilegato
    • Print on Demand

    Da: moluna, Greven, Germaniamoluna

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 83,50

    EUR 48,99 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: Più di 20 disponibili

    Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. One of the first textbooks on the topic of sparsity - a core area of current discrete mathematicsExtremely useful to both mathematicians and computer scientistsPedagogically excellentThis is the first book devoted to the systemat.…

  • Lingua: Inglese

    Editore: Springer, Springer Apr 2012, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 di 8 - Algorithms and Combinatorics

    • Rilegato
    • Print on Demand

    Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 96,29

    EUR 60,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 484 pp. Englisch.…