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}
}
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

01020'83'86'90'94'98'02'06'10'14'18
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.