Nešetřil, Jaroslav, <br/><br/>
Sparsity :  graphs, structures, and algorithms / 
Jaroslav Nešetřil, Patrice Ossona de Mendez. 
 - Heidelberg ;  New York :  Springer,  ©2012. 
 - xxiii, 457 pages :  illustrations (some color) ;  24 cm 
 - Algorithms and combinatorics ;  28 .
 - Algorithms and combinatorics ;  28. .
<br/><br/>Includes bibliographical references (pages 431-450) and index. 
<br/><br/> Introduction --  A few problems --  Prolegomena --  Measuring sparsity --  Classes and their classification --  Bounded height trees and tree-depth --  Decomposition --  Independence --  First-order CSP, limits, and homomorphism dualities --  Preservation theorems --  Restricted homomorphism dualities --  Counting --  Back to classes --  Classes with bounded expansion --  Some applications --  Property testing, hyperfiniteness, and separators --  Core algorithms --  Algorithmic applications --  Further directions. 
<br/><br/> "This is the first book devoted to the systematic study of sparse graphs and sparse finite structures"--Back cover. 
<br/><br/><label>ISBN: </label>9783642278747 3642278744 9783642427763 3642427766 
<br/><br/><label>LCCN: </label>2012937285 
<br/><br/><label>Nat. Bib. No.: </label>GBB253698  bnb 
<br/><br/><label>Nat. Bib. Agency Control No.: </label>016093062  Uk 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Sparse matrices.
<br/><br/><label>Dewey Class. No.: </label>511.5  / N575s