scientific article; zbMATH DE number 894719

zbMATH Open0848.90118MaRDI QIDQ4882994FDOQ4882994

Authors: Michael R. Bussieck 

Publication date: 24 October 1996

Title of this publication is not available (Why is that?)

Recommendations

• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
• Graph-Theoretic Concepts in Computer Science

zbMATH Keywords

polynomial time algorithmbottleneck augmentation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (1)

• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882994)