Computational Discrete Mathematics Advanced Lectures /
Computational Discrete Mathematics Advanced Lectures / [electronic resource] :
edited by Helmut Alt.
- 1st ed. 2001.
- VII, 173 p. online resource.
- Lecture Notes in Computer Science, 2122 1611-3349 ; .
- Lecture Notes in Computer Science, 2122 .
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.
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.
9783540455066
10.1007/3-540-45506-X doi
Algorithms.
Computer programming.
Computer science--Mathematics.
Discrete mathematics.
Computer graphics.
Algorithms.
Programming Techniques.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Computer Graphics.
Discrete Mathematics.
QA76.9.A43
518.1
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.
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.
9783540455066
10.1007/3-540-45506-X doi
Algorithms.
Computer programming.
Computer science--Mathematics.
Discrete mathematics.
Computer graphics.
Algorithms.
Programming Techniques.
Mathematics of Computing.
Discrete Mathematics in Computer Science.
Computer Graphics.
Discrete Mathematics.
QA76.9.A43
518.1