Heuristic algorithms for tree-depth of social networks
碩士 === 國立中正大學 === 資訊工程研究所 === 104 === The tree-depth of a graph G is the minimum height of rooted forest F such that G ⊆ closure(F), where closure(F) is the graph obtained from F by adding all possible edges between ancestors and descendants. We implemented a dynamic programming algorithm for findin...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21251409469502365495 |