Efficient algorithms for generalized cut trees

Authors:
Dan Gusfield;Dalit Naor
Affiliations:
Computer Science Division, University of California, Davis, CA;Computer Science Division, University of California, Davis, CA
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 5
Cited 3

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Multi-terminal maximum flows in node-capacitated networks

Discrete Applied Mathematics
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Very simple methods for all pairs network flow analysis

SIAM Journal on Computing
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)

The maximum flow problem with conflict and forcing conditions

INOC'11 Proceedings of the 5th international conference on Network optimization
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations

Discrete Optimization
The maximum flow problem with disjunctive constraints

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract