Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Gary Miller (computer scientist) - Wikiwand
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) Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
Ioannis Koutis
Ioannis Koutis's 53 research works in Medicine and Political Science
lowerbounds-survey/references.bib at master · dasarpmar/lowerbounds-survey · GitHub
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
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
Spectral Algorithms for Temporal Graph Cuts
PDF) Finding effective support-tree preconditioned
PDF) Two Arc-Disjoint Paths in Eulerian Digraphs
Sebastian Forster (University of Salzburg)
Ioannis Koutis's 53 research works in Medicine and Political Science
