Colorful Vertex Recoloring of Bipartite Graphs

Authors Boaz Patt-Shamir , Adi Rosén, Seeun William Umboh



PDF
Thumbnail PDF

File

LIPIcs.STACS.2025.70.pdf
  • Filesize: 0.88 MB
  • 19 pages

Document Identifiers

Author Details

Boaz Patt-Shamir
  • School of Electrical Engineering, Tel Aviv University, Israel
Adi Rosén
  • CNRS and Université Paris Cité, France
Seeun William Umboh
  • School of Computing and Information Systems, The University of Melbourne, Australia
  • ARC Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA), Melbourne, Australia

Cite As Get BibTex

Boaz Patt-Shamir, Adi Rosén, and Seeun William Umboh. Colorful Vertex Recoloring of Bipartite Graphs. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 70:1-70:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.70

Abstract

We consider the problem of vertex recoloring: we are given n vertices with their initial coloring, and edges arrive in an online fashion. The algorithm is required to maintain a valid coloring by means of vertex recoloring, where recoloring a vertex incurs a cost. The problem abstracts a scenario of job placement in machines (possibly in the cloud), where vertices represent jobs, colors represent machines, and edges represent "anti affinity" (disengagement) constraints. Online coloring in this setting is a hard problem, and only a few cases were analyzed. One family of instances which is fairly well-understood is bipartite graphs, i.e., instances in which two colors are sufficient to satisfy all constraints. In this case it is known that the competitive ratio of vertex recoloring is Θ(log n).
In this paper we propose a generalization of the problem, which allows using additional colors (possibly at a higher cost), to improve overall performance. Concretely, we analyze the simple case of bipartite graphs of bounded largest bond (a bond of a connected graph is an edge-cut that partitions the graph into two connected components). From the upper bound perspective, we propose two algorithms. One algorithm exhibits a trade-off for the uniform-cost case: given Ω(logβ) ≤ c ≤ O(log n) colors, the algorithm guarantees that its cost is at most O((log n)/c) times the optimal offline cost for two colors, where n is the number of vertices and β is the size of the largest bond of the graph. The other algorithm is designed for the case where the additional colors come at a higher cost, D > 1: given Δ additional colors, where Δ is the maximum degree in the graph, the algorithm guarantees a competitive ratio of O(log D). From the lower bounds viewpoint, we show that if the cost of the extra colors is D > 1, no algorithm (even randomized) can achieve a competitive ratio of o(log D). We also show that in the case of general bipartite graphs (i.e., of unbounded bond size), any deterministic online algorithm has competitive ratio Ω(min(D,log n)).

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Adversary models
Keywords
  • online algorithms
  • competitive analysis
  • resource augmentation
  • graph coloring

Metrics

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

References

  1. Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou. Competitive vertex recoloring. Algorithmica, 85(7):2001-2027, 2023. URL: https://doi.org/10.1007/s00453-022-01076-x.
  2. Reuven Bar-Yehuda and Shimon Even. A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2(2):198-203, 1981. URL: https://doi.org/10.1016/0196-6774(81)90020-1.
  3. Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, and Sander Verdonschot. Dynamic graph coloring. Algorithmica, 81(4):1319-1341, 2019. URL: https://doi.org/10.1007/s00453-018-0473-y.
  4. J.A. Bondy and U.S.R Murty. Graph Theory. Springer Publishing Company, Incorporated, 1st edition, 2008. Google Scholar
  5. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998. Google Scholar
  6. Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, and Anna Zych-Pawlewicz. Recoloring Interval Graphs with Limited Recourse Budget. In Proc. 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), volume 162 of Leibniz International Proceedings in Informatics (LIPIcs), pages 17:1-17:23, Dagstuhl, Germany, 2020. URL: https://doi.org/10.4230/LIPIcs.SWAT.2020.17.
  7. Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, and Uéverton S. Souza. Computing the largest bond and the maximum connected cut of a graph. Algorithmica, 83:1421-1458, January 2021. URL: https://doi.org/10.1007/S00453-020-00789-1.
  8. F. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput., 4(3):221-225, 1975. URL: https://doi.org/10.1137/0204019.
  9. Monika Henzinger, Stefan Neumann, and Andreas Wiese. Explicit and implicit dynamic coloring of graphs with bounded arboricity. CoRR, abs/2002.10142, 2020. URL: https://arxiv.org/abs/2002.10142.
  10. Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, and Sai Mohith Potluri. Trade-offs in dynamic coloring for bipartite and general graphs. Algorithmica, 85(4):854-878, 2023. URL: https://doi.org/10.1007/s00453-022-01050-7.
  11. Rajmohan Rajaraman and Omer Wasim. Competitive capacitated online recoloring. In Timothy 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 95:1-95:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.95.
  12. Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202-208, 1985. URL: https://doi.org/10.1145/2786.2793.
  13. Shay Solomon and Nicole Wein. Improved dynamic graph coloring. ACM Trans. Algorithms, 16(3):1-24, June 2020. URL: https://doi.org/10.1145/3392724.
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