DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
Berlin Springer-Verlag Berlin and Heidelberg GmbH & Co. K 2012 2012 ed. Hard cover New. 459 p. Algorithms and Combinatorics , 28. 100 Illustrations, color; 32 Illustrations, black and white; XXIII, 459 p. 132 illus., 100 illus. in color. Intended for college/higher education audience.
ISBN10: 3642278744, ISBN13: 9783642278747, [publisher: Springer Berlin Heidelberg] Hardcover 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. [Einbeck, Germany] [Publication Year: 2012] ...
ISBN10: 3642278744, ISBN13: 9783642278747, [publisher: Springer Berlin Heidelberg] Hardcover 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. [Einbeck, Germany] [Publication Year: 2012] ...
Berlin Springer-Verlag Berlin and Heidelberg GmbH & Co. K 2012 Hard cover New. Contains: Illustrations, black & white, Illustrations, color. Algorithms and Combinatorics . XXIII, 459 p. 132 illus., 100 illus. in color. Intended for college/higher education audience.
Berlin Springer-Verlag Berlin and Heidelberg GmbH & Co. K 2012 2012 ed. Hard cover New. 459 p. Algorithms and Combinatorics , 28. 100 Illustrations, color; 32 Illustrations, black and white; XXIII, 459 p. 132 illus., 100 illus. in color. Intended for college/higher education audience.
New. 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. ISBN 3642278744 9783642278747 [GB]
ISBN10: 3642278744, ISBN13: 9783642278747, [publisher: Springer] Hardcover This book offers a systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is typical of a fuzzy notion, the authors present a unifying classification of general classes of structures. Series: Algorithms and Combinatorics. Num Pages: 482 pages, 32 black & white illustrations, 100 colour illustrations, biography. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 30. Weight in Grams: 884. . 2012. 2012th Edition. Hardcover. . . . . Books ship from the US and Ireland. [Olney, MD, U.S.A.] [Publication Year: 2012]
ISBN10: 3642278744, ISBN13: 9783642278747, [publisher: Springer] Hardcover This book offers a systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is typical of a fuzzy notion, the authors present a unifying classification of general classes of structures. Series: Algorithms and Combinatorics. Num Pages: 482 pages, 32 black & white illustrations, 100 colour illustrations, biography. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 30. Weight in Grams: 884. . 2012. 2012th Edition. Hardcover. . . . . [Galway, GY, Ireland] [Publication Year: 2012]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
