Computational Discrete Mathematics
Advanced Lectures
Published on 24. October 2001
Book
Paperback/Softback
VII, 173 pages
978-3-540-42775-9 (ISBN)
Description
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.
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.
More details
Series
Edition
2001 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VII, 173 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 11 mm
Weight
295 gr
ISBN-13
978-3-540-42775-9 (9783540427759)
DOI
10.1007/3-540-45506-X
Schweitzer Classification
Other editions
Additional editions
E-Book
06/2003
Springer
€53.49
Available for download
Content
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.