Document Open Access Logo

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring

Authors Antoine El-Hayek , Kathrin Hanauer , Monika Henzinger

PDF

File

Thumbnail PDF
PDF
LIPIcs.SAND.2025.4.pdf
  • Filesize: 0.94 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • dynamic algorithm
  • graph algorithm
  • matching
  • b-matching
  • edge coloring

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Given a graph G that undergoes a sequence of edge insertions and deletions, we study the Maximum k-Edge Coloring problem (MkEC): Having access to k different colors, color as many edges of G as possible such that no two adjacent edges share the same color. While this problem is different from simply maintaining a b-matching with b = k, the two problems are related. However, maximum b-matching can be solved efficiently in the static setting, whereas MkEC is NP-hard and even APX-hard for k ≥ 2. 
We present new results on both problems: For b-matching, we show a new integrality gap result and we adapt Wajc’s matching sparsification scheme [David Wajc, 2020] for the case where b is a constant.
Using these as basis, we give three new algorithms for the dynamic MkEC problem: Our MatchO algorithm builds on the dynamic (2+ε)-approximation algorithm of Bhattacharya, Gupta, and Mohan [Sayan Bhattacharya et al., 2017] for b-matching and achieves a (2+ε)(k+1)/k-approximation in O(poly(log n, ε^-1)) update time against an oblivious adversary. Our MatchA algorithm builds on the dynamic (7+ε)-approximation algorithm by Bhattacharya, Henzinger, and Italiano [Sayan Bhattacharya et al., 2015] for fractional b-matching and achieves a (7+ε)(3k+3)/(3k-1)-approximation in O(poly(log n, ε^-1)) update time against an adaptive adversary. Moreover, our reductions use the dynamic b-matching algorithm as a black box, so any future improvement in the approximation ratio for dynamic b-matching will automatically translate into a better approximation ratio for our algorithms. Finally, we present a greedy algorithm with O(Δ+k) update time, which guarantees a 2.16 approximation factor.

Cite As Get BibTex

Antoine El-Hayek, Kathrin Hanauer, and Monika Henzinger. On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SAND.2025.4

Author Details

Antoine El-Hayek
  • Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
Kathrin Hanauer
  • Faculty of Computer Science, University of Vienna, Austria
Monika Henzinger
  • Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria

Funding

This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant https://www.doi.org/10.55776/Z422, grant https://www.doi.org/10.55776/I5982, and grant https://www.doi.org/10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was further supported by the Federal Ministry of Education and Research (BMBF) project, 6G-RIC: 6G Research and Innovation Cluster, grant 16KISK020K.

References

  1. Kook Jin Ahn and Sudipto Guha. Near linear time approximation schemes for uncapacitated and capacitated b-matching problems in nonbipartite graphs. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 239-258. SIAM, 2014. URL: https://doi.org/10.1137/1.9781611973402.18.
  2. Sepehr Assadi. Faster vizing and near-vizing edge coloring algorithms. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4861-4898. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.165.
  3. Surender Baswana, Manoj Gupta, and Sandeep Sen. Fully dynamic maximal matching in O (log n) update time. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 383-392. IEEE Computer Society, 2011. URL: https://doi.org/10.1109/FOCS.2011.89.
  4. Soheil Behnezhad. Time-optimal sublinear algorithms for matching and vertex cover. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 873-884. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00089.
  5. Aaron Bernstein, Aditi Dudeja, and Zachary Langley. A framework for dynamic matching in weighted graphs. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 668-681. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451113.
  6. Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, and Tianyi Zhang. Faster (Δ+1)-edge coloring: Breaking the m√n time barrier. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024, pages 2186-2201. IEEE, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00128.
  7. Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, and Danupon Nanongkai. Dynamic algorithms for graph coloring. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1-20. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.1.
  8. Sayan Bhattacharya, Martín Costa, Shay Solomon, and Tianyi Zhang. Even faster (δ+ 1)-edge coloring via shorter multi-step vizing chains. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4914-4947. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.167.
  9. Sayan Bhattacharya, Manoj Gupta, and Divyarthi Mohan. Improved algorithm for dynamic b-matching. In Kirk Pruhs and Christian Sohler, editors, 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, volume 87 of LIPIcs, pages 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ESA.2017.15.
  10. Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. Deterministic fully dynamic data structures for vertex cover and matching. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 785-804. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.54.
  11. Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano. Dynamic algorithms via the primal-dual method. Inf. Comput., 261:219-239, 2018. URL: https://doi.org/10.1016/j.ic.2018.02.005.
  12. Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai. New deterministic approximation algorithms for fully dynamic matching. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 398-411. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897568.
  13. Marcin Bienkowski, David Fuchssteiner, and Stefan Schmid. Optimizing reconfigurable optical datacenters: The power of randomization. In Dorian Arnold, Rosa M. Badia, and Kathryn M. Mohror, editors, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2023, Denver, CO, USA, November 12-17, 2023, pages 83:1-83:11. ACM, 2023. URL: https://doi.org/10.1145/3581784.3607057.
  14. Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, and Anna Zych. Online bipartite matching in offline time. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pages 384-393. IEEE Computer Society, 2014. URL: https://doi.org/10.1109/FOCS.2014.48.
  15. Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, and Chris Schwiegelshohn. Adaptive out-orientations with applications. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 3062-3088. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.110.
  16. Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva. Maximum flow and minimum-cost flow in almost-linear time. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 612-623. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00064.
  17. Zhi-Zhong Chen, Sayuri Konno, and Yuki Matsushita. Approximating maximum edge 2-coloring in simple graphs. Discret. Appl. Math., 158(17):1894-1901, 2010. URL: https://doi.org/10.1016/J.DAM.2010.08.010.
  18. Ilan Reuven Cohen, Binghui Peng, and David Wajc. Tight bounds for online edge coloring. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 1-25. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00010.
  19. Richard Cole, Kirstin Ost, and Stefan Schirra. Edge-coloring bipartite multigraphs in O(E log D) time. Comb., 21(1):5-12, 2001. URL: https://doi.org/10.1007/s004930170002.
  20. Ran Duan, Haoqing He, and Tianyi Zhang. Dynamic edge coloring with improved approximation. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 1937-1945. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.117.
  21. Ran Duan and Seth Pettie. Approximating maximum weight matching in near-linear time. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, pages 673-682. IEEE Computer Society, 2010. URL: https://doi.org/10.1109/FOCS.2010.70.
  22. Lene M. Favrholdt and Morten N. Nielsen. On-line edge-coloring with a fixed number of colors. Algorithmica, 35(2):176-191, 2003. URL: https://doi.org/10.1007/s00453-002-0992-3.
  23. Uriel Feige, Eran Ofek, and Udi Wieder. Approximating maximum edge coloring in multigraphs. In Klaus Jansen, Stefano Leonardi, and Vijay V. Vazirani, editors, Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, volume 2462 of Lecture Notes in Computer Science, pages 108-121. Springer, 2002. URL: https://doi.org/10.1007/3-540-45753-4_11.
  24. S. M. Ferdous, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar, and Bala Krishnamoorthy. Semi-streaming algorithms for weighted k-disjoint matchings. In Timothy M. Chan, Johannes Fischer, John Iacono, and Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pages 53:1-53:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.53.
  25. Harold N. Gabow. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, and Joel I. Seiferas, editors, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA, pages 448-456. ACM, 1983. URL: https://doi.org/10.1145/800061.808776.
  26. Harold N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In David S. Johnson, editor, SODA 1990, 22-24 January, San Francisco, CA, USA, pages 434-443. SIAM, 1990. URL: http://dl.acm.org/citation.cfm?id=320176.320229.
  27. Harold N Gabow, Takao Nishizeki, Oded Kariv, Daniel Leven, and Osamu Terada. Algorithms for edge-coloring. In Technical report 41/85. Tel Aviv University, 1985. Google Scholar
  28. Harold N. Gabow and Robert Endre Tarjan. Faster scaling algorithms for general graph-matching problems. J. ACM, 38(4):815-853, 1991. URL: https://doi.org/10.1145/115234.115366.
  29. Manoj Gupta and Richard Peng. Fully dynamic (1+ e)-approximate matchings. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 548-557. IEEE Computer Society, 2013. URL: https://doi.org/10.1109/FOCS.2013.65.
  30. Kathrin Hanauer, Monika Henzinger, Lara Ost, and Stefan Schmid. Dynamic demand-aware link scheduling for reconfigurable datacenters. In IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, New York City, NY, USA, May 17-20, 2023, pages 1-10. IEEE, 2023. URL: https://doi.org/10.1109/INFOCOM53939.2023.10229050.
  31. Kathrin Hanauer, Monika Henzinger, Stefan Schmid, and Jonathan Trummer. Fast and heavy disjoint weighted matchings for demand-aware datacenter topologies. In IEEE INFOCOM 2022 - IEEE Conference on Computer Communications, London, United Kingdom, May 2-5, 2022, pages 1649-1658. IEEE, 2022. URL: https://doi.org/10.1109/INFOCOM48880.2022.9796921.
  32. Ian Holyer. The NP-completeness of edge-coloring. SIAM J. Comput., 10(4):718-720, 1981. URL: https://doi.org/10.1137/0210055.
  33. John E. Hopcroft and Richard M. Karp. An n^5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2(4):225-231, 1973. URL: https://doi.org/10.1137/0202019.
  34. Marcin Jakub Kaminski and Lukasz Kowalik. Beyond the vizing’s bound for at most seven colors. SIAM J. Discret. Math., 28(3):1334-1362, 2014. URL: https://doi.org/10.1137/120899765.
  35. Mehrdad Khani, Manya Ghobadi, Mohammad Alizadeh, Ziyi Zhu, Madeleine Glick, Keren Bergman, Amin Vahdat, Benjamin Klenk, and Eiman Ebrahimi. SiP-ML: high-bandwidth optical network interconnects for machine learning training. In Proceedings of the ACM SIGCOMM, pages 657-675, 2021. Google Scholar
  36. Dénes König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen, 77(4):453-465, 1916. Google Scholar
  37. Adrian Kosowski. Approximating the maximum 2- and 3-edge-colorable subgraph problems. Discret. Appl. Math., 157(17):3593-3600, 2009. URL: https://doi.org/10.1016/j.dam.2009.04.002.
  38. Daniel Leven and Zvi Galil. NP completeness of finding the chromatic index of regular graphs. J. Algorithms, 4(1):35-44, 1983. URL: https://doi.org/10.1016/0196-6774(83)90032-9.
  39. L. Lovasz and M. D. Plummer. Matching Theory, volume 121 of North-Holland Mathematics Studies. Elsevier Science Ltd., 1986. Google Scholar
  40. Silvio Micali and Vijay V. Vazirani. An o(sqrt(|v|) |e|) algorithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, USA, 13-15 October 1980, pages 17-27. IEEE Computer Society, 1980. URL: https://doi.org/10.1109/SFCS.1980.12.
  41. Jayadev Misra and David Gries. A constructive proof of vizing’s theorem. Inf. Process. Lett., 41(3):131-133, 1992. URL: https://doi.org/10.1016/0020-0190(92)90041-S.
  42. Jeffrey C Mogul and Lucian Popa. What we talk about when we talk about cloud network performance. ACM SIGCOMM Computer Communication Review, 42(5):44-48, 2012. URL: https://doi.org/10.1145/2378956.2378964.
  43. Ofer Neiman and Shay Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 745-754. ACM, 2013. URL: https://doi.org/10.1145/2488608.2488703.
  44. Krzysztof Onak and Ronitt Rubinfeld. Maintaining a large matching and a small vertex cover. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 457-464. ACM, 2010. URL: https://doi.org/10.1145/1806689.1806753.
  45. Alexander Schrijver et al. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer, 2003. Google Scholar
  46. Corwin Sinnamon. A randomized algorithm for edge-colouring graphs in o(m√n) time. CoRR, abs/1907.03201, 2019. URL: https://arxiv.org/abs/1907.03201.
  47. Shay Solomon. Fully dynamic maximal matching in constant update time. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pages 325-334. IEEE Computer Society, 2016. URL: https://doi.org/10.1109/FOCS.2016.43.
  48. Daniel Stubbs and Virginia Vassilevska Williams. Metatheorems for dynamic weighted matching. In Christos H. Papadimitriou, editor, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, volume 67 of LIPIcs, pages 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.ITCS.2017.58.
  49. Vadim G Vizing. On an estimate of the chromatic class of a p-graph. Discret. Analiz., 3:25-30, 1964. Google Scholar
  50. David Wajc. Rounding dynamic matchings against an adaptive adversary. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 194-207. ACM, 2020. URL: https://doi.org/10.1145/3357713.3384258.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact