Edge-connectivity augmentation problems
Journal of Computer and System Sciences
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Applications of a poset representation to edge connectivity and graph rigidity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient splitting off algorithms for graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An eulerian trail traversing specified edges in given order
Journal of Graph Theory
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computing All Small Cuts in Undirected Networks
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
A representation of cuts within 6/5 times the edge connectivity with applications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computing edge-connectivity augmentation function in Õ(nm) time
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Edge-connectivity augmentation with partition constraints
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast edge orientation for unweighted graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hi-index | 0.00 |