Stock photo: cover may vary
Recent Advances in Algorithms and Combinatorics Hardback -
by Bruce A. Reed (Editor); Claudia L. Linhares-Sales (Editor)
- New
- Hardback
A$95.13
A$5.72
Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Standard delivery: 9 to 14 days
Ships from Cold Books (New York, United States)
Details
- Title Recent Advances in Algorithms and Combinatorics
- Author Bruce A. Reed (Editor); Claudia L. Linhares-Sales (Editor)
- Binding Hardback
- Edition U. S. EDITION
- Condition New
- Pages 352
- Volumes 1
- Language ENG
- Publisher Springer , New York, NY
- Publication date pp. 368
- Illustrated Yes
- Features Bibliography, Illustrated, Index
- Bookseller's Inventory # 6285644
- ISBN 9780387954349 / 0387954341
- Weight 1.42 lbs (0.64 kg)
- Dimensions 9.04 x 6.7 x 0.88 in (22.96 x 17.02 x 2.24 cm)
- Category Mathematics
- Library of Congress subjects Combinatorial analysis
- Library of Congress Catalogue Number 2002017379
- Dewey Decimal Code 511.6
- Quantity available 4
About Cold Books New York, United States
Reader reviews for Recent Advances in Algorithms and Combinatorics
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
First line
A set M of edges of a graph G is a matching of G if each vertex of G is incident with at most one edge of M and a perfect, matching of G if each vertex of G is incident with precisely one edge of M.
From the rear cover
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.
