TY  - BOOK
AU  - Alt,Helmut
ED  - SpringerLink (Online service)
TI  - Computational Discrete Mathematics: Advanced Lectures 
T2  - Lecture Notes in Computer Science,
SN  - 9783540455066
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2001///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer software
KW  - Computational complexity
KW  - Computer graphics
KW  - Combinatorics
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Computer Graphics
N1  - Lattice Paths and Determinants -- The Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Codes over Z 4 -- Degree Bounds for Long Paths and Cycles in k-Connected Graphs -- Data Structures for Boolean Functions BDDs — Foundations and Applications -- Scheduling under Uncertainty: Bounding the Makespan Distribution -- Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders -- Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches -- Check Character Systems and Anti-symmetric Mappings -- Algorithms in Pure Mathematics -- Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions
N2  - This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics. The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the areas covered are combinatorics, graph theory, coding theory, discrete and computational geometry, optimization, and algorithmic aspects of algebra
UR  - http://dx.doi.org/10.1007/3-540-45506-X
ER  -