Fast algorithms for maximal clique enumeration with limited memory
Maximal clique enumeration (MCE) is a long-standing problem in graph theory and has numerous important applications. Though extensively studied, most existing algorithms become impractical when the input graph is too large and is disk-resident. We first propose an efficient partition-based algorithm...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2013
|
| 在線閱讀: | https://hdl.handle.net/10356/98958 http://hdl.handle.net/10220/12578 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|