Gary Miller - Wikidata
centrtutorial/WWW16/proceedings/centrality.bib at master · rionda/centrtutorial · GitHub
PDF) A Graph-Theoretic Game and Its Application to the k -Server Problem
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
PDF) Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
Triangle-aware Spectral Sparsifiers and Community Detection
arXiv:2101.04610v1 [cs.SI] 10 Jan 2021
Spectral Algorithms for Temporal Graph Cuts
Publications
jedbib/jedbib.bib at master · jedbrown/jedbib · GitHub
Parallel Five-cycle Counting Algorithms
Parallel Five-cycle Counting Algorithms | ACM Journal of Experimental Algorithmics
CSrankings-Graph/dblp-aliases.csv at gh-pages-qt · tete1030/CSrankings-Graph · GitHub
crosstex-dbgen/xtx/focs.xtx at master · el33th4x0r/crosstex-dbgen · GitHub
Dagstuhl Seminar 17041: Randomization in Parameterized Complexity
LIPIcs,Vol.20,STACS'13] 30th International Symposium on Theoretical Aspects of Computer Science
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
Spectral Algorithms for Temporal Graph Cuts
arXiv:2101.04610v1 [cs.SI] 10 Jan 2021
PDF) DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams
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
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
Publications - Carnegie Mellon Database Group
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
Spectral Algorithms for Temporal Graph Cuts
