Triangle Counting in Large Sparse Graph
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 96 === In this paper, we develop a new algorithm to count the number of triangles in a graph $G(n, m)$. The latest efficient algorithm, Forward Algorithm, needs $O(m^{3/2})$ basic instructions'' execution time and $Theta(m)$ memory space. With the combination...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/22539959799403941512 |