Sparsity (Record no. 102669)

000 -LEADER
fixed length control field 03680nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-642-27875-4
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140220083309.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120423s2012 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642278754
-- 978-3-642-27875-4
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-27875-4
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA164-167.2
072 #7 - SUBJECT CATEGORY CODE
Subject category code PBV
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code MAT036000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.6
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Nešetřil, Jaroslav.
Relator term author.
245 10 - TITLE STATEMENT
Title Sparsity
Medium [electronic resource] :
Remainder of title Graphs, Structures, and Algorithms /
Statement of responsibility, etc by Jaroslav Nešetřil, Patrice Ossona de Mendez.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2012.
300 ## - PHYSICAL DESCRIPTION
Extent XXIII, 457p. 132 illus., 100 illus. in color.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Algorithms and Combinatorics,
International Standard Serial Number 0937-5511 ;
Volume number/sequential designation 28
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Part I Presentation: 1. Introduction -- 2. A Few Problems -- 3. Commented Contents -- Part II. The Theory: 4. Prolegomena -- 5. Measuring Sparsity -- 6. Classes and their Classification -- 7. Bounded Height Trees and Tree-Depth -- 8. Decomposition -- 9. Independence -- 10. First-Order Constraint Satisfaction Problems and Homomorphism Dualities -- 11. Restricted Homomorphism Dualities -- 12. Counting -- 13. Back to Classes -- Part III Applications: 14. Classes with Bounded Expansion – Examples -- 15. Property Testing, Hyperfiniteness and Separators -- 16. Algorithmic Applications -- 17. Other Applications -- 18. Conclusion -- Bibliography -- Index -- List of Symbols .
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete groups.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Logic, Symbolic and mathematical.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Convex and Discrete Geometry.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical Logic and Foundations.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ossona de Mendez, Patrice.
Relator term author.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642278747
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Algorithms and Combinatorics,
-- 0937-5511 ;
Volume number/sequential designation 28
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-27875-4
912 ## -
-- ZDB-2-SMA

No items available.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue