发明授权
- 专利标题: Identifying connected components of a graph in parallel
- 专利标题(中): 并行识别图形的连接组件
-
申请号: US11201765申请日: 2005-08-11
-
公开(公告)号: US07764629B2公开(公告)日: 2010-07-27
- 发明人: Simon H. Kahan
- 申请人: Simon H. Kahan
- 申请人地址: US WA Seattle
- 专利权人: Cray Inc.
- 当前专利权人: Cray Inc.
- 当前专利权人地址: US WA Seattle
- 代理机构: Perkins Coie LLP
- 主分类号: G06N99/00
- IPC分类号: G06N99/00
摘要:
A method and system for finding connected components of a graph using a parallel algorithm is provided. The connected nodes system performs a search algorithm in parallel to identify subgraphs of the graph in which the nodes of the subgraph are connected. The connected nodes system also identifies which subgraphs have at least one edge between their nodes. Thus, the connected nodes system effectively generates a hyper-graph with the subgraphs as hyper-nodes that are connected when subgraphs have at least one edge between their nodes. The connected nodes system may then perform a conventional connected component algorithm on the hyper-graph to identify the connected hyper-nodes, which effectively identifies the connected nodes of the underlying graphs.
公开/授权文献
- US20060034194A1 Identifying connected components of a graph in parallel 公开/授权日:2006-02-16
信息查询