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