Title | Computational discrete mathematics : advanced lectures / Helmut Alt (ed.) |
---|---|
Imprint | Berlin : Springer, c2001 |
Descript | vi, 171 p. ; 23 cm |
Lattice Paths and Determinants -- Nearest Neighbor -- Explicit and Implicit Enforcing - Randomized Optimization -- Degree Bounds for Long Paths and Cycles in k-connnected 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
LOCATION | CALL# | STATUS |
---|---|---|
Central Library (4th Floor) | 510 C738 | CHECK SHELVES |
Chulalinet's Book Delivery Request