Data structures for mobile data
Journal of Algorithms
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
A Fast Construction oF Disjoint Paths in Communication Networks
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Parametric and Kinetic Minimum Spanning Trees
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Online decision problems with large strategy sets
Online decision problems with large strategy sets
Random sampling in matroids, with applications to graph connectivity and minimum spanning trees
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Sorting and selection on dynamic data
Theoretical Computer Science
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
The power of local information in PageRank
Proceedings of the 22nd international conference on World Wide Web companion
| Hi-index | 0.00 |
Motivated by applications that concern graphs that are evolving and massive in nature, we define a new general framework for computing with such graphs. In our framework, the graph changes over time and an algorithm can only track these changes by explicitly probing the graph. This framework captures the inherent tradeoff between the complexity of maintaining an up-to-date view of the graph and the quality of results computed with the available view. We apply this framework to two classical graph connectivity problems, namely, path connectivity and minimum spanning trees, and obtain efficient algorithms.