The Input/Output Complexity of Triangle Enumeration
SIGMOD/PODS'14: International Conference on Management of Data Snowbird Utah USA June, 2014（2014）
摘要
We consider the well-known problem of enumerating all triangles of an undirected graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges, $M 0$. Our results are based on a new color coding technique, which may be of independent interest.
更多查看译文
关键词
Triangle listing,external memory,cache-oblivious,cache-aware,lower bound
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要