Dynamic graph coloring

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

研究成果: Conference contribution

13 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルAlgorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings
編集者Faith Ellen, Antonina Kolokolova, Jorg-Rudiger Sack
出版社Springer Verlag
ページ97-108
ページ数12
ISBN(印刷版)9783319621265
DOI
出版ステータスPublished - 2017
イベント15th International Symposium on Algorithms and Data Structures, WADS 2017 - St. John’s, Canada
継続期間: 2017 7 312017 8 2

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10389 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other15th International Symposium on Algorithms and Data Structures, WADS 2017
CountryCanada
CitySt. John’s
Period17/7/3117/8/2

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Dynamic graph coloring」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル