9780821834589

Book Description: Amer Mathematical Society, 2004. Paperback. Book Condition: New. **New! NO remainder mark!. Bookseller Inventory # mon0000228462

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Book Description: American Mathematical Society, United States, 2004. Paperback. Book Condition: New. 254 x 178 mm. Brand New Book with Free Worldwide Delivery. Bookseller Inventory # AAN9780821834589

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Book Description: American Mathematical Society. Book Condition: New. Graph coloring is one of the oldest and best-known problems of graph theory. As people grew accustomed to applying the tools of graph theory to the solutions of real-world technological and organizational problems, new chromatic models emerged as a natural way of tackling many practical situations. Statistics show that graph coloring is one of the central issues in the collection of several hundred classical combinatorial problems. This book is devoted to problems in graph coloring, which can be viewed as one area of discrete optimization. Chapters are dedicated to various models and are largely independent of one another. In each chapter, the author highlights algorithmic aspects of the presented models, i.e., the construction of polynomial-time algorithms for graph coloring. This is an expanded and updated translation of the prizewinning book originally published in Polish, Optymalizacja dyskretna. Modele i metody kolorowania grafow. It is suitable for graduate students and researchers interested in graph theory. Brand NEW unread book. Soft cover bound book. Bookseller Inventory # 9780821834589

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Book Description: American Mathematical Society. Paperback. Book Condition: new. BRAND NEW, Graph Colorings, Marek Kubale, Graph coloring is one of the oldest and best-known problems of graph theory. As people grew accustomed to applying the tools of graph theory to the solutions of real-world technological and organizational problems, new chromatic models emerged as a natural way of tackling many practical situations. Statistics show that graph coloring is one of the central issues in the collection of several hundred classical combinatorial problems. This book is devoted to problems in graph coloring, which can be viewed as one area of discrete optimization. Chapters are dedicated to various models and are largely independent of one another.In each chapter, the author highlights algorithmic aspects of the presented models, i.e., the construction of polynomial-time algorithms for graph coloring. This is an expanded and updated translation of the prizewinning book originally published in Polish, "Optymalizacja dyskretna". Modele i metody kolorowania grafow. It is suitable for graduate students and researchers interested in graph theory. Bookseller Inventory # B9780821834589

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Book Description: Amer Mathematical Society, 2004. Paperback. Book Condition: Brand New. illustrated edition edition. 208 pages. 10.00x7.00x0.50 inches. In Stock. Bookseller Inventory # __0821834584

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Book Description: American Mathematical Society, 2004. Paperback. Book Condition: New. Brand new. We distribute directly for the publisher. Graph coloring is one of the oldest and best-known problems of graph theory. As people grew accustomed to applying the tools of graph theory to the solutions of real-world technological and organizational problems, new chromatic models emerged as a natural way of tackling many practical situations. Statistics show that graph coloring is one of the central issues in the collection of several hundred classical combinatorial problems.This book is devoted to problems in graph coloring, which can be viewed as one area of discrete optimization. Chapters are dedicated to various models and are largely independent of one another. In each chapter, the author highlights algorithmic aspects of the presented models, i.e., the construction of polynomial-time algorithms for graph coloring.This is an expanded and updated translation of the prizewinning book originally published in Polish, Optymalizacja dyskretna. Modele i metody kolorowania grafów. It is suitable for graduate students and researchers interested in graph theory. Bookseller Inventory # 1004210114

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Book Description: Book Condition: New. New item. Bookseller Inventory # QX-059-48-1909801

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question