Article

Free access

An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

Author:

Harold N. GabowAuthors Info & Claims

STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing

Pages 448 - 456

https://doi.org/10.1145/800061.808776

Published: 01 December 1983 Publication History

Abstract

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.

References

[1]

R.P. Anstee, "An algorithmic proof of Tutte's f-factor theorem", Res. Rept. CORR 81-28, Dept. of Combinatorics and Optimization, Univ. of Waterloo, Waterloo, Ontario, 1981.

[2]

C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.

Digital Library

[3]

R. Bernstein, "Shortest paths in undirected graphs", M.S. Thesis, Stevens Inst. Technology, 1982.

[4]

G.B. Dantzig, Linear Programming and Extensions, Princeton Univ. Press, Princeton, NJ, 1963.

[5]

Edmonds, J., "Maximum matching and a polyhedron with 0,1-vertices," J. Res. Nat. Bur. Standards 69B (1965), 125-130.

[6]

J. Edmonds, "An introduction to matching," Notes of Engineering Summer Conference, Univ. of Michigan, Ann Arbor, 1967.

[7]

J. Edmonds and E.L. Johnson, "Matching: A well-solved class of integer linear programs," Proc. Calgray Int. Conf. on Combinatorial Structures and Their Applications, Gordon and Breach, New York, 1970, pp. 89-92.

[8]

J. Edmonds and E.L. Johnson, "Matching, Euler tours and the Chinese postman," Math. Programming 5, 1973, pp. 88-124.

Digital Library

[9]

J. Edmonds and R.M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM 19, 2, 1972, pp. 248-264.

Digital Library

[10]

S. Even and R.E. Tarjan, "Network flow and testing graph connectivity", SIAM J, Comput. 4, 4, 1975, pp. 507-518.

Digital Library

[11]

H. Gabow, "An efficient reduction technique for degree-constrained subgraph and bidirectied network flow problems," Tech. Rept. CU-CS-243-83, University of Colorado, Boulder, Colorado, 1983.

[12]

H. Gabow, "An efficient implementation of Edmonds' algorithm for maximum weight matching on graphs," Tech. Rept. CU-CS-075-75, University of Colorado, Boulder, Colorado, 1975.

[13]

A.J. Goldman, "Optimal matchings and degree-constrained subgraphs," J. Res. National Bureau of Standards 68B, 1, 1964, pp. 27-29.

[14]

Z. Galil, S. Micali, H. Gabow, "Priority queues with variable priority and an O(E V log V) algorithm for finding a maximal weighted matching in general graphs," Proc. 23rd Annual Symp. on Foundation of Comp. Sci., 1982, pp. 225-261.

[15]

H.N. Gabow and M. Stallman, "Scheduling multitask jobs with deadlines on one processor," abstract.

[16]

Hopcroft, J. and Karp, R, "An n5/2 algorithm for maximum matchings in bipartite graphs," SIAM. J. Comp. 2, 4, 1973, pp. 225-231.

[17]

E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.

[18]

S. Micali and V.V. Vazirani, "An 0((@@@@)V.E) algorithm for finding maximum matching in general graphs," Proc. 21st Annual Symp. on Found. of Comp. Sci., 1980, pp. 17-27.

[19]

Y. Shiloach, "Another look at the degree constrained subgraph problem," Inf. Proc. Letters 12, 2, 1981, pp. 89-92.

[20]

D.D.K. Sleator, "An 0(nm log n) algorithm for maximum network flow," Ph.D. Diss., Tech. Rept. STAN-CS-80-831, Stanford Univ., Stanford, CA, 1980.

Digital Library

[21]

D. Sleator and R.E. Tarjan, "A data structure for dynamic trees," Proc. 13th Annual ACM Symp. on Th. of Computing, Milwaukee, Wisc., 1981, pp. 114-122.

Digital Library

[22]

R.E. Tarjan, "Shortest paths," Ch. 17 in unpublished manuscript. 1982.

[23]

R.J. Urquhart, "Degree-constrained subgraphs of linear graphs," Ph.D. Diss., University of Michigan, 1967.

[24]

L.J. White, "A parametric study of matchings and covering in weighted graphs," Ph.D. Diss., Systems Eng. Lab., Dept. of Electrical Eng., University of Michigan. Ann Arbor, 1967.

Cited By

Chen YChen ZKennedy CLin GXu YZhang A(2024)Approximating the directed path partition problemInformation and Computation10.1016/j.ic.2024.105150(105150)Online publication date: Jan-2024
https://doi.org/10.1016/j.ic.2024.105150
Gong MEdgar BFan JLin GMiyano E(2024)Approximation Algorithms for Covering Vertices by Long PathsAlgorithmica10.1007/s00453-024-01242-386:8(2625-2651)Online publication date: 28-May-2024
https://doi.org/10.1007/s00453-024-01242-3
Heistermann MWarnett JBommes D(2023)Min-Deviation-Flow in Bi-directed Graphs for T-Mesh QuantizationACM Transactions on Graphics10.1145/359243742:4(1-25)Online publication date: 26-Jul-2023
https://dl.acm.org/doi/10.1145/3592437
Show More Cited By

Index Terms

An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Network flows
2. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness
  2. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows

Recommendations

On the approximability of some degree-constrained subgraph problems

In this article we provide hardness results and approximation algorithms for the following three natural degree-constrained subgraph problems, which take as input an undirected graph G=(V,E). Let d>=2 be a fixed integer. The Maximumd-degree-bounded ...
On flows in bidirected graphs

Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279-292]. He proved ...
Some degree and forbidden subgraph conditions for a graph to have a k -contractible edge

An edge in a k -connected graph is said to be k -contractible if the contraction of the edge results in a k -connected graph. We say that a k -connected graph G satisfies " m -degree-sum condition" if x V ( W ) deg G ( x ) m k + 1 hold for any connected ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing

December 1983

487 pages

ISBN:0897910990

DOI:10.1145/800061

Copyright © 1983 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1983

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

148
Total Citations
View Citations
603
Total Downloads

Downloads (Last 12 months)203
Downloads (Last 6 weeks)23

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen YChen ZKennedy CLin GXu YZhang A(2024)Approximating the directed path partition problemInformation and Computation10.1016/j.ic.2024.105150(105150)Online publication date: Jan-2024
https://doi.org/10.1016/j.ic.2024.105150
Gong MEdgar BFan JLin GMiyano E(2024)Approximation Algorithms for Covering Vertices by Long PathsAlgorithmica10.1007/s00453-024-01242-386:8(2625-2651)Online publication date: 28-May-2024
https://doi.org/10.1007/s00453-024-01242-3
Heistermann MWarnett JBommes D(2023)Min-Deviation-Flow in Bi-directed Graphs for T-Mesh QuantizationACM Transactions on Graphics10.1145/359243742:4(1-25)Online publication date: 26-Jul-2023
https://dl.acm.org/doi/10.1145/3592437
Gong MChen ZLin GWang L(2023)An Approximation Algorithm for Covering Vertices by $$4^+$$-PathsCombinatorial Optimization and Applications10.1007/978-3-031-49611-0_33(459-470)Online publication date: 9-Dec-2023
https://doi.org/10.1007/978-3-031-49611-0_33
Erzin ASharankhaev K(2023)Three-Bar Charts Packing ProblemAdvances in Optimization and Applications10.1007/978-3-031-22990-9_5(61-75)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-22990-9_5
Rahman AMedvedev P(2022)Assembler artifacts include misassembly because of unsafe unitigs and underassembly because of bidirected graphsGenome Research10.1101/gr.276601.12232:9(1746-1753)Online publication date: 27-Jul-2022
https://doi.org/10.1101/gr.276601.122
Gima THanaka TKiyomi MKobayashi YOtachi Y(2022)Exploring the gap between treedepth and vertex cover through vertex integrityTheoretical Computer Science10.1016/j.tcs.2022.03.021918:C(60-76)Online publication date: 29-May-2022
https://dl.acm.org/doi/10.1016/j.tcs.2022.03.021
Boehmer NKoana TNiedermeier R(2022)A refined complexity analysis of fair districting over graphsAutonomous Agents and Multi-Agent Systems10.1007/s10458-022-09594-237:1Online publication date: 28-Dec-2022
https://dl.acm.org/doi/10.1007/s10458-022-09594-2
Huang DPettie S(2022)Approximate Generalized Matching: f-Matchings and f-Edge CoversAlgorithmica10.1007/s00453-022-00949-584:7(1952-1992)Online publication date: 25-Feb-2022
https://doi.org/10.1007/s00453-022-00949-5
Chen YChen ZKennedy CLin GXu YZhang A(2022)Approximation Algorithms for the Directed Path Partition ProblemsFrontiers of Algorithmics10.1007/978-3-030-97099-4_2(23-36)Online publication date: 3-Mar-2022
https://doi.org/10.1007/978-3-030-97099-4_2
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents