PDF) Locating highly connected clusters in large networks with HyperLogLog counters
PDF) Towards the effective parallel computation of matrix pseudospectra.
Parallel Five-Cycle Counting Algorithms
Publications - Carnegie Mellon Database Group
centrtutorial/centrality.bib at master · rionda/centrtutorial · GitHub
PDF) Finding and Counting Vertex-Colored Subtrees
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
30th International Symposium on Theoretical Aspects of Computer Science Natacha Portier Thomas Wilke
Dagstuhl Seminar 17041: Randomization in Parameterized Complexity
PDF) LUEM : Local User Engagement Maximization in Networks
Parallel Five-cycle Counting Algorithms
PDF) Locating highly connected clusters in large networks with HyperLogLog counters
Publications
Spectral Algorithms for Temporal Graph Cuts
PDF) Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Spectral Algorithms for Temporal Graph Cuts
Parallel Five-cycle Counting Algorithms | ACM Journal of Experimental Algorithmics
Parallel Five-cycle Counting Algorithms | ACM Journal of Experimental Algorithmics
Spectral Algorithms for Temporal Graph Cuts
