Reid Andersen

From MaRDI portal
Person:879955


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Almost optimal local graph clustering using evolving sets
Journal of the ACM
2018-08-02Paper
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
2015-02-04Paper
A local algorithm for finding dense subgraphs
ACM Transactions on Algorithms
2014-11-18Paper
Speeding up algorithms on compressed web graphs
Internet Mathematics
2012-04-18Paper
Local partitioning for directed graphs using pagerank
Internet Mathematics
2011-02-28Paper
Local Computation of PageRank Contributions
Internet Mathematics
2011-02-28Paper
An algorithm for improving graph partitions
 
2010-08-06Paper
scientific article; zbMATH DE number 5764906 (Why is no real title available?)
 
2010-08-06Paper
Using PageRank to Locally Partition a Graph
Internet Mathematics
2009-04-28Paper
Finding Dense Subgraphs with Size Bounds
Algorithms and Models for the Web-Graph
2009-02-10Paper
On the Stability of Web Crawling and Web Search
Algorithms and Computation
2009-01-29Paper
Local Partitioning for Directed Graphs Using PageRank
Algorithms and Models for the Web-Graph
2008-04-11Paper
Local Computation of PageRank Contributions
Algorithms and Models for the Web-Graph
2008-04-11Paper
Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
Lecture Notes in Computer Science
2007-11-13Paper
Drawing power law graphs using a local/global decomposition
Algorithmica
2007-05-10Paper
Modeling the Small-World Phenomenon with Local Network Flow
Internet Mathematics
2006-06-26Paper
Graph Drawing
Lecture Notes in Computer Science
2005-12-07Paper
Algorithms and Models for the Web-Graph
Lecture Notes in Computer Science
2005-08-22Paper


Research outcomes over time


This page was built for person: Reid Andersen