Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
SIAM Journal on Computing
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Algorithms
Sparsification of influence networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
Hi-index | 0.89 |
Flow network simplification can reduce the size of the flow network and hence the amount of computation performed by flow algorithms. We present the first linear time algorithm for the undirected network case. We also give an O(|E|*(|V|+|E|)) time algorithm for the directed case, an improvement over the previous best O(|V|+|E|^2log|V|) time solution. Both of our algorithms are quite simple.