Dynamic graph coloring

Luis Barba; Jean Cardinal; Matias Korman; Stefan Langerman; André Van Renssen; Marcel Roeloffzen; Sander Verdonschot

doi:10.1007/978-3-319-62127-2_9

Dynamic graph coloring

Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André Van Renssen, Marcel Roeloffzen, Sander Verdonschot

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

13 Citations (Scopus)

Abstract

In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN^1/d)-coloring while recoloring at most O(d) vertices per update, where C and N are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses the trade-off, maintaining an O(Cd)-coloring with O(dN^1/d) recolorings per update. We also present a lower bound, showing that any algorithm that maintains a c-coloring of a 2-colorable graph on N vertices must recolor at least Ω(N 2/ c(c−1)) vertices per update, for any constant c ≥ 2.

Original language	English
Title of host publication	Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings
Editors	Faith Ellen, Antonina Kolokolova, Jorg-Rudiger Sack
Publisher	Springer Verlag
Pages	97-108
Number of pages	12
ISBN (Print)	9783319621265
DOIs	https://doi.org/10.1007/978-3-319-62127-2_9
Publication status	Published - 2017
Event	15th International Symposium on Algorithms and Data Structures, WADS 2017 - St. John’s, Canada Duration: 2017 Jul 31 → 2017 Aug 2

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10389 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International Symposium on Algorithms and Data Structures, WADS 2017
Country	Canada
City	St. John’s
Period	17/7/31 → 17/8/2

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-62127-2_9

Fingerprint Dive into the research topics of 'Dynamic graph coloring'. Together they form a unique fingerprint.

Cite this

Barba, L., Cardinal, J., Korman, M., Langerman, S., Van Renssen, A., Roeloffzen, M., & Verdonschot, S. (2017). Dynamic graph coloring. In F. Ellen, A. Kolokolova, & J-R. Sack (Eds.), Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings (pp. 97-108). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-62127-2_9

Dynamic graph coloring. / Barba, Luis; Cardinal, Jean; Korman, Matias; Langerman, Stefan; Van Renssen, André; Roeloffzen, Marcel; Verdonschot, Sander.

Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. ed. / Faith Ellen; Antonina Kolokolova; Jorg-Rudiger Sack. Springer Verlag, 2017. p. 97-108 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Barba, L, Cardinal, J, Korman, M, Langerman, S, Van Renssen, A, Roeloffzen, M & Verdonschot, S 2017, Dynamic graph coloring. in F Ellen, A Kolokolova & J-R Sack (eds), Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10389 LNCS, Springer Verlag, pp. 97-108, 15th International Symposium on Algorithms and Data Structures, WADS 2017, St. John’s, Canada, 17/7/31. https://doi.org/10.1007/978-3-319-62127-2_9

Barba L, Cardinal J, Korman M, Langerman S, Van Renssen A, Roeloffzen M et al. Dynamic graph coloring. In Ellen F, Kolokolova A, Sack J-R, editors, Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. Springer Verlag. 2017. p. 97-108. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-62127-2_9

Barba, Luis ; Cardinal, Jean ; Korman, Matias ; Langerman, Stefan ; Van Renssen, André ; Roeloffzen, Marcel ; Verdonschot, Sander. / Dynamic graph coloring. Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. editor / Faith Ellen ; Antonina Kolokolova ; Jorg-Rudiger Sack. Springer Verlag, 2017. pp. 97-108 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{bbfea1a86c144c6e8945ec888787095c,

title = "Dynamic graph coloring",

abstract = "In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN1/d)-coloring while recoloring at most O(d) vertices per update, where C and N are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses the trade-off, maintaining an O(Cd)-coloring with O(dN1/d) recolorings per update. We also present a lower bound, showing that any algorithm that maintains a c-coloring of a 2-colorable graph on N vertices must recolor at least Ω(N 2/ c(c−1)) vertices per update, for any constant c ≥ 2.",

author = "Luis Barba and Jean Cardinal and Matias Korman and Stefan Langerman and {Van Renssen}, Andr{\'e} and Marcel Roeloffzen and Sander Verdonschot",

note = "Funding Information: M. K. was partially supported by MEXT KAKENHI grant Nos. 12H00855, and 17K12635. A. v. R. and M. R. were supported by JST ERATO Grant Number JPMJER1305, Japan. L. B. was supported by the ETH Postdoctoral Fellowship. S. V. was partially supported by NSERC and the Carleton-Fields postdoctoral award.; 15th International Symposium on Algorithms and Data Structures, WADS 2017 ; Conference date: 31-07-2017 Through 02-08-2017",

year = "2017",

doi = "10.1007/978-3-319-62127-2_9",

language = "English",

isbn = "9783319621265",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "97--108",

editor = "Faith Ellen and Antonina Kolokolova and Jorg-Rudiger Sack",

booktitle = "Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings",

}

TY - GEN

T1 - Dynamic graph coloring

AU - Barba, Luis

AU - Cardinal, Jean

AU - Korman, Matias

AU - Langerman, Stefan

AU - Van Renssen, André

AU - Roeloffzen, Marcel

AU - Verdonschot, Sander

N1 - Funding Information: M. K. was partially supported by MEXT KAKENHI grant Nos. 12H00855, and 17K12635. A. v. R. and M. R. were supported by JST ERATO Grant Number JPMJER1305, Japan. L. B. was supported by the ETH Postdoctoral Fellowship. S. V. was partially supported by NSERC and the Carleton-Fields postdoctoral award.

PY - 2017

Y1 - 2017

N2 - In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN1/d)-coloring while recoloring at most O(d) vertices per update, where C and N are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses the trade-off, maintaining an O(Cd)-coloring with O(dN1/d) recolorings per update. We also present a lower bound, showing that any algorithm that maintains a c-coloring of a 2-colorable graph on N vertices must recolor at least Ω(N 2/ c(c−1)) vertices per update, for any constant c ≥ 2.

AB - In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN1/d)-coloring while recoloring at most O(d) vertices per update, where C and N are the maximum chromatic number and maximum number of vertices, respectively. The second algorithm reverses the trade-off, maintaining an O(Cd)-coloring with O(dN1/d) recolorings per update. We also present a lower bound, showing that any algorithm that maintains a c-coloring of a 2-colorable graph on N vertices must recolor at least Ω(N 2/ c(c−1)) vertices per update, for any constant c ≥ 2.

UR - http://www.scopus.com/inward/record.url?scp=85024370811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85024370811&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-62127-2_9

DO - 10.1007/978-3-319-62127-2_9

M3 - Conference contribution

AN - SCOPUS:85024370811

SN - 9783319621265

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 97

EP - 108

BT - Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings

A2 - Ellen, Faith

A2 - Kolokolova, Antonina

A2 - Sack, Jorg-Rudiger

PB - Springer Verlag

T2 - 15th International Symposium on Algorithms and Data Structures, WADS 2017

Y2 - 31 July 2017 through 2 August 2017

ER -