Recent Advances in Algorithms and Combinatorics

  • Bruce A. Reed
  • Cláudia L. Sales

Table of contents

  1. Front Matter
    Pages i-xiii
  2. M. H. de Carvalho, C. L. Lucchesi, U. S. R. Murty
    Pages 1-25
  3. F. Maffray
    Pages 65-84
  4. B. A. Reed
    Pages 85-107
  5. J. L. Szwarcfiter
    Pages 109-136
  6. M.-F. Sagot, Y. Wakabayashi
    Pages 245-287
  7. Y. Kohayakawa, V. Rödl
    Pages 289-351

About this book

Introduction

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 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 Computer Science of McGill Univeristy.

Keywords

Algorithmic Combinatorics Algorithms in Graph Theory Graph Graph theory Matching Theory of Algorithms algorithms

Editors and affiliations

  • Bruce A. Reed
    • 1
    • 2
  • Cláudia L. Sales
    • 3
  1. 1.Equipe CombinatoireCNRSParisFrance
  2. 2.McGill UniversityMontrealCanada
  3. 3.Departamento de Computacao—LIAUniversidade Federal do CearaFortalezaBrasil

Bibliographic information

  • DOI https://doi.org/10.1007/b98891
  • Copyright Information Springer Science+Business Media New York 2003
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4684-9268-2
  • Online ISBN 978-0-387-22444-2
  • Series Print ISSN 1613-5237
  • Series Online ISSN 2197-4152
  • About this book