首页 | 本学科首页   官方微博 | 高级检索  
     

并行图论算法研究进展
引用本文:陈国良,梁维发.并行图论算法研究进展[J].计算机研究与发展,1995,32(9):1-16.
作者姓名:陈国良  梁维发
作者单位:中国科技大学计算机系并行分布计算研究中心
摘    要:在这篇综述文章中,我们将重点介绍并行图论处近年来的发展概况及主要成果,并给出一些可能的发展方向。具体内容包括:基于共享存储模型上的图搜索技术、连发支及最小生成树算法、增值并行图论算法、最短路径算法、极大独立集算法、极大匹配与最大匹配算法,图着色算法、求欧拉回路及哈密尔顿回路算法,图同构算法、图K连通算法以及最大流最小割算法等。

关 键 词:并行图论  算法  图论

RESEARCH ADVANCES IN PARALLEL GRAPH ALGORITHMS
Chen Guoliang, Liang Weifa and Shen Hong.RESEARCH ADVANCES IN PARALLEL GRAPH ALGORITHMS[J].Journal of Computer Research and Development,1995,32(9):1-16.
Authors:Chen Guoliang  Liang Weifa and Shen Hong
Abstract:In this paper, we give a survey of the research advances in parallel graph algorithms in these years. These algorithms based on the shared memory computation model (PRAM) include searching graphs, computing connected components, finding minimum spanning trees, computing incremental graphs, finding shortest paths, constructing maximal independent set and maximal matching, coloring edges and vertex of graphs, finding Euler tour and Hamiltonian cycles,testing isomorphism and k-connectivity of graphs, computing maximum flows and minimum cuts,etc.
Keywords:PRAM  NC algorithm  RNC algorithm  graph problem  analysis of algorithm complexity    
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号