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

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (6)

  • Nuevo (6)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Springer, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 de 8 - Algorithms and Combinatorics

    • Tapa dura

    Librería: Books Puddle, Woodside, NY, Estados Unidos de AmericaBooks Puddle

    Vendedor de 4 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 118,38

    Envío por EUR 3,51 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 4 disponibles

    Condición: New. pp. 484.

  • Idioma: Inglés

    Editorial: Springer, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 de 8 - Algorithms and Combinatorics

    • Tapa dura

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 137,14

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Buch. Condición: 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.…

  • Idioma: Inglés

    Editorial: Springer, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 de 8 - Algorithms and Combinatorics

    • Tapa dura
    • Impresión bajo demanda

    Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 78,24

    Envío por EUR 8,00 
    Se envía de Italia a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: new. Questo è un articolo print on demand.

  • Idioma: Inglés

    Editorial: Springer, Springer Apr 2012, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 de 8 - Algorithms and Combinatorics

    • Tapa dura
    • Impresión bajo demanda

    Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 96,29

    Envío por EUR 23,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Buch. Condición: 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.…

  • Idioma: Inglés

    Editorial: Springer Berlin Heidelberg, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 de 8 - Algorithms and Combinatorics

    • Tapa dura
    • Impresión bajo demanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 83,50

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: 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.…

  • Idioma: Inglés

    Editorial: Springer, Springer Apr 2012, 2012

    3642278744 / 9783642278747

    Serie: Libro 4 de 8 - Algorithms and Combinatorics

    • Tapa dura
    • Impresión bajo demanda

    Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 96,29

    Envío por EUR 60,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Buch. Condición: 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.…