Global Methods for Combinatorial Isoperimetric Problems
Global Methods for Combinatorial Isoperimetric Problems
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.
The study of combinatorial isoperimetric problems exploits similarities between discrete optimization problems and the classical continuous setting. Based on his many years of teaching experience, Larry Harper focuses on global methods of problem solving. His text will enable graduate students and researchers to quickly reach the most current state of research in this topic. Harper includes numerous worked examples, exercises and material about applications to computer science.
- Global method leads to interesting new insights and results
- Text designed for graduate students with numerous exercises and examples
- Author gives applications to computer science to broaden market
Reviews & endorsements
"It is a very nice and useful book, written by a real expert in the field. I believe that both specialists in the area and mathematicians with other backgrounds will find lots of new interesting material in this book." Igor Shparlinski, Mathematics of Computation
Product details
February 2004Hardback
9780521832687
250 pages
229 × 152 × 17 mm
0.54kg
Available
Table of Contents
- 1. The edge-isoperimetric problem
- 2. The minimum path problem
- 3. Stabilization and compression
- 4. The vertex-isoperimetric problem
- 5. Stronger stabilization
- 6. Higher compression
- 7. Isoperimetric problems on infinite graphs
- 8. Isoperimetric problems on complexes
- 9. Morphisms for MWI problems
- 10. Passage to the limit
- 11. Afterword
- 12. The classical isoperimetric problem.
