Sparsity Graphs Structures And Algorithms(1st Edition)

Authors:

Jaroslav Nea Eta Il ,Patrice Ossona De Mendez

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 1 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$0

List Price: $71.64 Savings: $71.64 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Sparsity Graphs Structures And Algorithms

Price:

$9.99

/month

Book details

ISBN: 3642278744, 978-3642278747

Book publisher: Springer

Offer Just for You!: Buy 2 books before the end of January and enter our lucky draw.

Book Price $0 : 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.