Abstract
Given a digraph D, the minimum integral dicycle cover problem (known also as the minimum feedback arc set problem) is to find a minimum set of arcs that intersects every dicycle; the maximum integral dicycle packing problem is to find a maximum set of pairwise arc disjoint dicycles. These two problems are NP-complete.
Assume D has a 2-vertex cut. We show how to derive a minimum dicycle cover (a maximum dicycle packing) for D, by composing certain covers (packings) of the corresponding pieces. The composition of the covers is simple and was partially considered in the literature before. The main contribution of this paper is to the packing problem. Let τ be the value of a minimum integral dicycle cover, and ν* (ν) the value of a maximum (integral) dicycle packing. We show that if τ = ν then a simple composition, similar to that of the covers, is valid for the packing problem. We use these compositions to extend an O(n3) (resp., O(n4)) algorithm for finding a minimum integral dicycle cover (resp., packing) from planar digraphs to K3,3-free digraphs (i.e., digraphs not containing any subdivision of K3,3).
However, if τ ≠ ν, then such a simple composition for the packing problem is not valid. We show, that if the pieces satisfy, what we call, the stability property, then a simple composition does work. We prove that if ν = ν* holds for each piece, then the stability property holds as well. Further, we use the stability property to show that if ν = ν* holds for each piece, then ν = ν* holds for D as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Barahona, J. Foulupt, and A.R. Mahjoub, “Composition of graphs and polyhedra IV: Acyclic spanning subgraphs,” SIAM J. Discrete Math., vol. 7, no. 3, pp. 390–402, 1994.
F. Barahona and A.R. Mahjoub, “Composition of graphs and polyhedra II: Stable sets,” SIAM J. Discrete Math., vol. 7, no. 3, pp. 359–371, 1994a.
F. Barahona and A.R. Mahjoub, “Composition of graphs and polyhedra III: Graphs with no W 4 minor,” SIAM J. Discrete Math., vol. 7, no. 3, pp. 372–389, 1994b.
K.S. Booth and G.S. Lueker, “Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms,” J. Comp. Sys. Sci., vol. 13, pp. 335–379, 1976.
G. Even, J. Naor, S. Rao, and B. Shieber, “Divide-and-conquer approximation algorithms via spreading metrics,” in Proc. 36th FOCS, 1995, pp. 62–71.
M.M. Flood, “Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem,” Networks, vol. 20, pp. 1–23, 1990.
A. Frank, “How to make a digraph strongly connected,” Combinatorica, vol. 1, pp. 145–153, 1981.
H.N. Gabow, “A representation for crossing set families with application to submodular flow problems,” in Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 202–211.
A. Galluccio and M. Loebl, “Even directed cycles in H-free graphs,” IASI T.R. No. 410, July, 1995.
M. Grötschel, M. Jünger, and G. Reinelt, “Acyclic subdigraphs and linear orderings: Polytopes, facets, and a cutting plane algorithm,” in Graphs and Orders, I. Rival (Ed.), D. Reidel Publishing Company, 1985, pp. 217–264.
M. Grötschel, L. Lovász, and Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag: Berlin, 1988.
D.W. Hall, “A note on primitive skew curves,” Bull. Amer. Math. Soc., vol. 49, pp. 935–937, 1943.
J.E. Hopcroft and R.E. Tarjan, “Dividing a graph into triconnected components,” SIAM J. Comput. 2, pp. 135–158, 1973.
M. Jünger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Heldermann Verlag, 1985.
R.M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Plemum Press: New-York, 1972, pp. 85–103.
A. Karzanov, “On the minimal number of arcs of a digraph meeting all its directed cutsets,” Graph Theory Newsletters, vol. 8, no. 4, 1979, Abstract.
A.K. Kelmans, “Graph planarity and related topics,” Contemporary Math., vol. 147, pp. 635–667, 1991.
S. Khuller, “Extended planar graph algorithms to K 3,3-free graphs,” Information and Computation, vol. 84, pp. 13–25, 1990.
H.W. Lenstra, Jr., “The acyclic subgraph problem,” Report BW26, Mathematisch Centrum, Amsterdam, 1973.
L. Lovàsz, “On two minimax theorems in graph theory,” J. Combinatorial Theory (B), vol. 21, pp. 96–103, 1976.
C.L. Lucchesi, “A minimax equality for directed graphs,” Ph.D. Dissertation, University of Waterloo, Waterloo, Ontario, 1976.
C.L. Lucchesi and D.H. Younger, “A minimax relation for directed graphs,” J. London Math. Soc., vol. 17, no. 2, pp. 369–374, 1978.
J.F. Mascotorchino and P. Michand, Optimisation en analyse ordinale des données, Masson: Paris, 1979.
R. Manor and M. Penn, “An extended planar algorithm for maximum integral two-flow,” Networks, vol. 32, pp. 67–76, 1998.
Z. Nutov and M. Penn, “On the integral dicycle packings and covers and the Linear Ordering Polytope,” Discrete Applied Mathematics, vol. 60, pp. 293–309, 1995.
V. Ramachandran, “Finding a minimum feedback arc set in reducible flow graphs,” J. of Algorithms, vol. 9, pp. 299–313, 1998.
P. Seymour, “Packing directed circuits fractionally,” Combinatorica, vol. 15, pp. 281–288, 1995.
V.V. Vazirani, “NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems,” Information and Computation, vol. 80, pp. 152–164, 1989.
K. Wagner, “Uber eine Erweiterung eines Satzes von Kuratowski,” D. Math., pp. 280–285, 1937.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nutov, Z., Penn, M. On Integrality, Stability and Composition of Dicycle Packings and Covers. Journal of Combinatorial Optimization 4, 235–251 (2000). https://doi.org/10.1023/A:1009802905533
Issue Date:
DOI: https://doi.org/10.1023/A:1009802905533