Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
PDF) Locating highly connected clusters in large networks with HyperLogLog counters
PDF) Towards the effective parallel computation of matrix pseudospectra.
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
lowerbounds-survey/references.bib at master · dasarpmar/lowerbounds-survey · GitHub
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Ioannis Koutis's 53 research works in Medicine and Political Science
Publications
Spectral Algorithms for Temporal Graph Cuts
PDF) Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
Sebastian Forster (University of Salzburg)
Spectral Algorithms for Temporal Graph Cuts
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
PDF) Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
PDF) Finding effective support-tree preconditioned
Gary Miller (computer scientist) - Wikiwand
Ioannis Koutis's 53 research works in Medicine and Political Science
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
