Name
Abstract | ||
|---|---|---|
The maximum clique problem (MCP) has various applications to reveal the structure and function of graphs. Graphs are constantly updated in the real life. However, no algorithm is specifically designed for dynamic graph. Although MCP in dynamic graphs can be solved by simply invoking a state-of-the-art static approach, such as PMC, when the graph is updated, such an approach of... |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TKDE.2020.3003701 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | DocType | Volume |
Heuristic algorithms,Approximation algorithms,Partitioning algorithms,Sun,Time complexity,Size measurement,Classification algorithms | Journal | 34 |
Issue | ISSN | Citations |
4 | 1041-4347 | 0 |
PageRank | References | Authors |
0.34 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sheng-Li Sun | 1 | 50 | 2.87 |
| Weiping Li | 2 | 69 | 10.79 |
| Yimo Wang | 3 | 0 | 0.34 |
| Weilong Liao | 4 | 0 | 0.34 |
| Philip S. Yu | 5 | 30670 | 3474.16 |