Name
Abstract | ||
|---|---|---|
Several variants of the subgraph isomorphism problem, e.g., finding, counting, and estimating frequencies of subgraphs in networks arise in a number of real world applications, such as web analysis, disease diffusion prediction, and social network analysis. These problems are computationally challenging in having to scale to very large networks with millions of vertices. In this paper, we present ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TMSCS.2017.2768426 | IEEE Transactions on Multi-Scale Computing Systems |
Keywords | DocType | Volume |
Image color analysis,Encoding,Approximation algorithms,Complexity theory,Algorithm design and analysis,Electronic mail,Bioinformatics | Journal | 4 |
Issue | ISSN | Citations |
3 | 2332-7766 | 0 |
PageRank | References | Authors |
0.34 | 0 | 10 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhao Zhao | 1 | 65 | 2.63 |
| Langshi Chen | 2 | 1 | 1.70 |
| Mihai Avram | 3 | 0 | 0.34 |
| Meng Li | 4 | 3 | 0.71 |
| Guanying Wang | 5 | 64 | 4.21 |
| Ali R Butt | 6 | 210 | 17.36 |
| Maleq Khan | 7 | 365 | 27.71 |
| Madhav Marathe | 8 | 3 | 0.83 |
| Judy Qiu | 9 | 743 | 43.25 |
| Anil Kumar S. Vullikanti | 10 | 1135 | 98.30 |