Highly Influenced

# An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems

@inproceedings{Gabow1983AnER, title={An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems}, author={Harold N. Gabow}, booktitle={STOC}, year={1983} }

- Published 1983 in STOC
DOI:10.1145/800061.808776

Efficient algorithms are given for the bidirected network flow problem and the degree-constrained subgraph problem. Four versions of each are solved, depending on whether edge capacities/multiplicities are one or arbitrary, and whether maximum value/maximum cardinality or minimum cost/maximum weight is the objective. A version of the shortest path problem is also efficiently solved. The algorithms use a reduction technique that solves one problem instance by reducing to a number of problems.Â

Highly Influential

This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Highly Cited

This paper has 212 citations. REVIEW CITATIONS

#### 5 Figures & Tables

#### Topics

#### Statistics

Citations per Year

#### 213 Citations

Semantic Scholar estimates that this publication has

**213**citations based on the available data.See our **FAQ** for additional information.

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=808776.