a study of graph sampling problem
碩士 === 國立東華大學 === 資訊工程學系 === 100 === Due to the di±culty of studying a huge graph, graph sampling issue is in great demand. According to di®erent requirements of the samples, we can use di®erent methods to solve the graph sampling problem. In this thesis, we propose two algo-rithms. Our method can b...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/reyq53 |