Fast Parallel Algorithms for Graph Matching Problems:Combinatorial, Algebraic, and Probabilistic Approach(Oxford Lecture Series in Mathematics and Its Applications)

图匹配问题的快速并行算法

数学史

售   价:
1450.00
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
1998年03月26日
装      帧
精装
ISBN
9780198501626
复制
页      码
224
开      本
234x156mm
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
The matching problem is one of the central problems in graph theory as well as in the theopry of algorithms and their applications. This book will provide the reader with a comprehensive and straightforward introduction to the basic methods of designing efficient parallel algorithms for graph matching problems. The text is written for students at the beginning graduate level. The exposition is mostly self-contained and example-driven. Prerequisites have been kept to a minimum by including relevant background material. The book contains full details of several new techniques and should also be of interest to research workers in computer scince, operations research, discrete mathematics, and electrical engineering.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个