Recent Advances In Algorithms And Combinatorics

Preparing link to download Please wait... Download

E-Book Overview

Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinator combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems. This book highlights a few of the exciting recent developments in algorithmic combinatorics, including the search for patterns in DNA and protein sequences, the theory of semi-definite programming and its role in combinatorial optimization, and the algorithmic aspects of tree decompositions and it's applications to the theory of databases, code optimization, and bioinformatics.

Claudia Linhares-Sales is Assistant Professor of Computer Science at the Federal University of Cear?, Brazil. Bruce Reed is Canada Research Chair in Graph Theory at the School of of Computer Science of McGill University.


E-Book Content

Editors-in-Chief Re´dacteurs-en-chef Jonathan Borwein Peter Borwein 1 2 3 4 5 6 7 8 9 10 11 HERMAN/KUCˇERA/SˇIMSˇA Equations and Inequalities ARNOLD Abelian Groups and Representations of Finite Partially Ordered Sets BORWEIN/LEWIS Convex Analysis and Nonlinear Optimization LEVIN/LUBINSKY Orthogonal Polynomials for Exponential Weights KANE Reflection Groups and Invariant Theory PHILLIPS Two Millennia of Mathematics DEUTSCH Best Approximations in Inner Product Spaces FABIAN ET AL. Functional Analysis and Infinite-Dimensional Geometry KRˇ´IZˇEK/LUCA/SOMER 17 Lectures on Fermat Numbers BORWEIN Computational Excursions in Analysis and Number Theory REED/SALES Recent Advances in Algorithms and Combinatorics Bruce A. Reed Cla´udia L. Sales Editors Recent Advances in Algorithms and Combinatorics With 52 I