Computational Discrete Mathematics

Advanced Lectures

Helmut Alt

174 pages, parution le 21/01/2002

Ajouter à une liste

Indisponible

Résumé

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.

Contents

Lattice Paths and Determinants
The Nearest Neighbor
Explicit and Implicit Enforcing - Randomized Optimization
Codes over Z4
Degree Bounds for Long Paths and Cycles in k-connected Graphs
Data Structures for Boolean Functions
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

Author Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Helmut Alt
Parution	21/01/2002
Nb. de pages	174
Format	15,5 x 23,5
Couverture	Broché
Poids	291g
Intérieur	Noir et Blanc
EAN13	9783540427759