PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Spectral Algorithms for Temporal Graph Cuts
Parallel Five-cycle Counting Algorithms
Sebastian Forster - Paris Lodron Universität Salzburg
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
PDF) Towards the effective parallel computation of matrix pseudospectra.
centrtutorial/WWW16/proceedings/centrality.bib at master · rionda/centrtutorial · GitHub
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
Parallel Five-cycle Counting Algorithms
PDF) Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
Dataset statistics. We count the number of unique hyper- edges and the... | Download Scientific Diagram
Parallel Five-cycle Counting Algorithms | ACM Journal of Experimental Algorithmics
PDF) DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams
Spectral Algorithms for Temporal Graph Cuts
PDF) A Graph-Theoretic Game and Its Application to the k -Server Problem
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
Spectral Algorithms for Temporal Graph Cuts
Spectral Algorithms for Temporal Graph Cuts
PDF) DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams
Gary Miller - Wikidata
Dagstuhl Seminar 17041: Randomization in Parameterized Complexity
PDF) Limits and Applications of Group Algebras for Parameterized Problems
