Computational Discrete Mathematics

Advanced Lectures

Buch | Softcover

VII, 173 Seiten

2001 | 2001
Springer Berlin (Verlag)
978-3-540-42775-9 (ISBN)

Artikel merken

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.

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.

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.

Erscheint lt. Verlag	24.10.2001
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VII, 173 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	297 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Themenwelt	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Algorithm analysis and problem complexity • algorithms • Coding • coding theory • combinatorics • Computational Algebra • Computational Algorithms • Computational Geometry • Computational Graph Theory • computational mathematics • Computer • data structures • Discrete Mathematics • Diskrete Mathematik • Geometry • Graph Algorithms • Graph Computations • mapping • Randomization
ISBN-10	3-540-42775-9 / 3540427759
ISBN-13	978-3-540-42775-9 / 9783540427759
Zustand	Neuware