000 -LEADER |
fixed length control field |
03528nam a22005055i 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20140310151457.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 |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA164-167.2 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
511.6 |
Edition number |
23 |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg, |
-- |
2012. |
912 ## - |
-- |
ZDB-2-SMA |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Nešetřil, Jaroslav. |
Relator term |
author. |
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
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. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
XXIII, 457p. 132 illus., 100 illus. in color. |
Other physical details |
online resource. |
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
Title |
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. |
|
Topical term or geographic name as entry element |
Computer software. |
|
Topical term or geographic name as entry element |
Computational complexity. |
|
Topical term or geographic name as entry element |
Combinatorics. |
|
Topical term or geographic name as entry element |
Discrete groups. |
|
Topical term or geographic name as entry element |
Logic, Symbolic and mathematical. |
|
Topical term or geographic name as entry element |
Mathematics. |
|
Topical term or geographic name as entry element |
Combinatorics. |
|
Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
Topical term or geographic name as entry element |
Convex and Discrete Geometry. |
|
Topical term or geographic name as entry element |
Mathematical Logic and Foundations. |
|
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 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-27875-4 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
E-Book |