Spectral Algorithms for Temporal Graph Cuts
jedbib/jedbib.bib at master · jedbrown/jedbib · GitHub
PDF) A Graph-Theoretic Game and Its Application to the k -Server Problem
PDF) Finding effective support-tree preconditioned
Publications - Carnegie Mellon Database Group
arXiv:2101.04610v1 [cs.SI] 10 Jan 2021
Parallel Five-cycle Counting Algorithms | ACM Journal of Experimental Algorithmics
Spectral Algorithms for Temporal Graph Cuts
Triangle-aware Spectral Sparsifiers and Community Detection
PDF) Towards the effective parallel computation of matrix pseudospectra.
Spectral Algorithms for Temporal Graph Cuts
CSrankings-Graph/dblp-aliases.csv at gh-pages-qt · tete1030/CSrankings-Graph · GitHub
LIPIcs,Vol.20,STACS'13] 30th International Symposium on Theoretical Aspects of Computer Science
PDF) DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams
centrtutorial/WWW16/proceedings/centrality.bib at master · rionda/centrtutorial · GitHub
Parallel Five-cycle Counting Algorithms
Publications
Gary Miller - Wikidata
PDF) Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
PDF) DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams
Spectral Algorithms for Temporal Graph Cuts
Parallel Five-cycle Counting Algorithms | ACM Journal of Experimental Algorithmics
