Graph Colorings(Contemporary Mathematics)

组合数学

原   价:
1296.00
售   价:
1037.00
优惠
平台大促 低至8折优惠
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出版时间
2004年06月30日
装      帧
平装
ISBN
9780821834589
复制
页      码
208
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个