Libros UCLV { BETA }

This book is an extensive compilation of graph theory, aimed to solve several matching problems. It can be used a general text-book about Combinatorial Optimization, yet its center is matching.

This book grew out of several courses in combinatorics and graph theory given at Appalachian State University and UCLA in recent years. A one-semester course for juniors at Appalachian State University focusing on graph theory coveredmost of Chapter 1 and the first part of Chapter 2. A one-quarter course at UCLA on combinatorics for undergraduates concentrated on the topics in Chapter 2 and included some parts of Chapter 1. Another semester course at Appalachian State for advanced undergraduates and beginning graduate students covered most of the topics from all three chapters.

Network Algorithm are useful in the current days (Internet for example requires it). This book give several algorithm in networks such as Maximum Flow, Maximum Flow with Minimum Cost, etc.

Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability, covering literally thousands of applications in such wide-ranging fields as chemistry and physics, computer networking, most branches of engineering, manufacturing, public policy and social systems, scheduling and routing, telecommunications, and transportation. It is classical, dating from the work of Gustav Kirchhoff and other eminent physical scientists of the last century, and yet vibrant and current, bursting with new results and new approaches. Its heritage is rooted in the traditional fields of mechanics, engineering, and applied mathematics as well as the contemporary fields of computer science and operations research.