Finding and Counting Tree-Like Subgraphs Using MapReduce.

IEEE Transactions on Multi-Scale Computing Systems(2018)

引用 2|浏览102
暂无评分
摘要
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 ...
更多
查看译文
关键词
Image color analysis,Encoding,Approximation algorithms,Complexity theory,Algorithm design and analysis,Electronic mail,Bioinformatics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要