Abstract
We consider the dynamic graph coloring problem restricted to the class of interval graphs. At each update step the algorithm is presented with an interval to be colored, or a previously colored interval to delete. The goal of the algorithm is to efficiently maintain a proper coloring of the intervals with as few colors as possible by an online algorithm. In the incremental model, each update step presents the algorithm with an interval to be colored. The problem is closely connected to the online vertex coloring problem of interval graphs for which the Kierstead-Trotter (KT) algorithm achieves the best possible competitive ratio. We first show that a sub-quadratic time direct implementation of the KT-algorithm is unlikely to exist conditioned on the correctness of the Online Boolean Matrix Vector multiplication conjecture due to Henzinger et al. [9]. We then design an incremental algorithm that is subtly different from the KT-algorithm and uses at most \(3 \omega - 2\) colors, where \(\omega \) is the maximum clique in the interval graph associated with the set of intervals. Our incremental data structure maintains a proper coloring in amortized \(O(\log n + \varDelta )\) update time where n is the total number of intervals inserted and \(\varDelta \) is the maximum degree of a vertex in the interval graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dutot, A., Olivier, D., Guinand, F., Pign, Y.: On the decentralized dynamic graph coloring problem. In: Complex Systems and Self Organization Modelling, pp. 259–261 (2007)
Barba, L., et al.: Dynamic graph coloring. In: Ellen, F., Kolokolova, A., Sack, J.R. (eds.) Algorithms and Data Structures. LNCS, vol. 10389, pp. 97–108. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62127-2_9
Barenboim, L., Maimon, T.: Fully-dynamic graph algorithms with sublinear time inspired by distributed computing. In: International Conference on Computational Science, ICCS 2017, Zurich, Switzerland, 12–14 June 2017, pp. 89–98 (2017)
Bhattacharya, S., Chakrabarty, D., Henzinger, M., Nanongkai, D.: Dynamic algorithms for graph coloring. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7–10 January 2018, pp. 1–20 (2018)
Hardy, B., Lewis, R., Thompson, J.: Tackling the edge dynamic graph coloring problem with and without future adjacency information. J. Heuristics 24, 1–23 (2017)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn, pp. 463–467. The MIT Press, Cambridge (2009). Chapter 17
Epstein, L., Levy, M.: Online interval coloring and variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 602–613. Springer, Heidelberg (2005). https://doi.org/10.1007/11523468_49
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
Henzinger, M., Krinninger, S., Nanongkai, D., Saranurak, T.: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14–17 June 2015, pp. 21–30 (2015)
Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33(143–153), 98 (1981)
Larsen, K.G., Williams, R.: Faster online matrix-vector multiplication. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16–19 January 2017, pp. 2182–2189 (2017)
Narayanaswamy, N.S.: Dynamic storage allocation and on-line colouring interval graphs. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 329–338. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27798-9_36
Ouerfelli, L., Bouziri, H.: Greedy algorithm for dynamic graph coloring. In: Communications, Computing and Control Applications, pp. 1–5 (2011)
Poudel, S., Gokhale, M., Ripeanu, M., Sallinen, S., Iwabuchi, K., Pearce, R.A.: Graph coloring as a challenge problem for dynamic graph processing on distributed systems. In: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 347–358 (2016)
Solomon, S., Wein, N.: Improved dynamic graph coloring. In: 26th Annual European Symposium on Algorithms, ESA 2018, 20–22 August 2018, Helsinki, Finland, pp. 72:1–72:16 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Raguvir, J.G., Kashyop, M.J., Narayanaswamy, N.S. (2019). Data Structures for Incremental Interval Coloring. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-030-26176-4_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26175-7
Online ISBN: 978-3-030-26176-4
eBook Packages: Computer ScienceComputer Science (R0)