Towards efficient motif-based graph partitioning: An adaptive sampling approach
In this paper, we study the problem of efficient motif-based graph partitioning (MGP). We observe that existing methods require to enumerate all motif instances to compute the exact edge weights for partitioning. However, the enumeration is prohibitively expensive against large graphs. We thus propo...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2021
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/6205 https://ink.library.smu.edu.sg/context/sis_research/article/7208/viewcontent/TR.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |