• Cite/Export
  Cite/Export

  Copy a citation

  APA (6th ed.)

  

  Chicago (Author-Date, 15th ed.)

  

  Harvard (18th ed.)

  

  MLA (7th ed.)

  

  Turabian (6th ed.)

  

  Export a citation

  Export to RefWorks   Export to EndNote / Reference Manager   Export to EasyBib
  Export to EndNote / Reference Manager(non-Latin)   Cancel

  Note: Citations are based on reference standards. However, formatting rules can vary widely between applications and fields of interest or study. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied.
• Print
• E-mail
  E-mail

  All fields are required.

  The E-mail Address(es) field is required. Please enter recipient e-mail address(es).

  The E-mail Address(es) you entered is(are) not in a valid format. Please re-enter recipient e-mail address(es).

  You may send this item to up to five recipients.

  Enter recipient e-mail address(es): Separate up to five addresses with commas (,)

  The name field is required. Please enter your name.

  Enter your name: The subject field is required. Please enter the subject. Subject:

  The E-mail message field is required. Please enter the message.

  E-mail Message: I thought you might be interested in this item at http://www.worldcat.org/oclc/1126447036 Title: Sparsity : Graphs, Structures, and Algorithms Author: Jaroslav Nešetřil; Patrice Ossona de Mendez Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012. ISBN/ISSN: 3642278752 9783642278754 9783642278747 3642278744 OCLC:1126447036

  
  

  Please verify that you are not a robot.

  Cancel
• Share
• Permalink
  Permalink

  Copy this URL to link to this page:

• Write a review
• Rate this item:
• • 1
  • 2
  • 3
  • 4
  • 5

Sparsity : Graphs, Structures, and Algorithms

Author:	Jaroslav Nešetřil; Patrice Ossona de Mendez
Publisher:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Series:	Algorithms and combinatorics, 28.
Edition/Format:	eBook : Document : English : 1st ed. 2012View all editions and formats
Summary:	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.  Read more...
Rating:	(not yet rated) 0 with reviews - Be the first.
Subjects	Combinatorial analysis. Computational complexity. Discrete groups. View all subjects
More like this	Similar Items