A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem

  • Stepan ArtamonovEmail author
  • Maxim Babenko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9538)


A perfect 2-matching in an undirected graph \(G = (V, E)\) is a function \(x :E \rightarrow \left\{ 0,1,2 \right\} \) such that for each node \(v \in V\) the sum of values x(e) on all edges e incident to v equals 2. If \(\mathop {\text {supp}}\nolimits (x) = \left\{ e \in E \mid x(e) \ne 0 \right\} \) contains no triangles, then x is called triangle-free. Polyhedrally, triangle-free 2-matchings are harder than 2-matchings, but easier than usual 1-matchings.

Concerning the weighted case, Cornuéjols and Pulleyblank devised a combinatorial strongly-polynomial algorithm that finds a perfect triangle-free 2-matching of minimum cost. A suitable implementation of their algorithm runs in \(O(VE \log V)\) time.

In case of integer edge costs in the range [0, C], for both 1- and 2-matchings some faster scaling algorithms are known that find optimal solutions within \(O(\sqrt{V\alpha (E, V)\log {V}}E \log (VC))\) and \(O(\sqrt{V}E \log (VC))\) time, respectively, where \(\alpha \) denotes the inverse Ackermann function. So far, no efficient cost-scaling algorithm is known for finding a minimum-cost perfect triangle-free 2-matching. The present paper fills this gap by presenting such an algorithm with time complexity of \(O(\sqrt{V}E \log {V} \log (VC))\).


Parallel Edge Edge Cost Free Vertex Maximal Prefix Suitable Implementation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [BGR10]
    Babenko, M.A., Gusakov, A., Razenshteyn, I.P.: Triangle-free 2-matchings revisited. Discrete Math. Alg. Appl. 2, 643–654 (2010)CrossRefMathSciNetzbMATHGoogle Scholar
  2. [CP80a]
    Cornuéjols, G., Pulleyblank, W.: A matching problem with side conditions. Discrete Math. 29, 135–159 (1980)CrossRefMathSciNetzbMATHGoogle Scholar
  3. [CP80b]
    Cornuéjols, G., Pulleyblank, W.R.: Perfect triangle-free 2-matchings. Math. Program. Stud. 13, 1–7 (1980)CrossRefzbMATHGoogle Scholar
  4. [Edm65]
    Edmonds, J.: Maximum matching and a polyhedron with \(0,1\) vertices. J. Res. Natl. Bur. Stan. 69B, 125–130 (1965)CrossRefMathSciNetGoogle Scholar
  5. [FM95]
    Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci. 51, 261–272 (1995)CrossRefMathSciNetzbMATHGoogle Scholar
  6. [GK04]
    Goldberg, A.V., Karzanov, A.V.: Maximum skew-symmetric flows and matchings. Math. Program. 100(3), 537–568 (2004)CrossRefMathSciNetzbMATHGoogle Scholar
  7. [GT89]
    Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput. 18, 1013–1036 (1989)CrossRefMathSciNetzbMATHGoogle Scholar
  8. [GT91]
    Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. J. ACM 38, 815–853 (1991)CrossRefMathSciNetzbMATHGoogle Scholar
  9. [HK73]
    Hopcroft, J.E., Karp, R.M.: An \(n^{5/2}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)CrossRefMathSciNetzbMATHGoogle Scholar
  10. [HK95]
    Henzinger, M.R., King, V.: Randomized dynamic graph algorithms with polylogarithmic time per operation. In: Proceeding of 27th ACM Symposium on Theory of Computing, pp. 519–527 (1995)Google Scholar
  11. [Kob14]
    Kobayashi, Y.: Triangle-free 2-matchings and m-concave functions on jump systems. Discrete Appl. Math. 175, 35–42 (2014)CrossRefMathSciNetzbMATHGoogle Scholar
  12. [MV80]
    Micali, S., Vazirani, V.: An \(O(\sqrt{{V}} \cdot {E})\) algorithm for finding maximum matching in general graphs. In: Proceedings of 21st IEEE Symposium on Foundations of Computer Science, pp. 248–255 (1980)Google Scholar
  13. [ST83]
    Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Moscow State UniversityMoscowRussia
  2. 2.National Research University Higher School of Economics (HSE)MoscowRussia

Personalised recommendations