{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T03:59:36Z","timestamp":1789876776123,"version":"4.0.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319621265","type":"print"},{"value":"9783319621272","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_9","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Dynamic Graph Coloring"],"prefix":"10.1007","author":[{"given":"Luis","family":"Barba","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcel","family":"Roeloffzen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/130914140","volume":"44","author":"S Baswana","year":"2015","unstructured":"Baswana, S., Gupta, M., Sen, S.: Fully dynamic maximal matching in $${O}(\\log n)$$ update time. SIAM J. on Comp. 44(1), 88\u2013113 (2015)","journal-title":"SIAM J. on Comp."},{"issue":"4","key":"9_CR2","first-page":"35","volume":"8","author":"S Baswana","year":"2012","unstructured":"Baswana, S., Khurana, S., Sarkar, S.: Fully dynamic randomized algorithms for graph spanners. ACM Trans. on Alg. 8(4), 35 (2012)","journal-title":"ACM Trans. on Alg."},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/FI-2012-620","volume":"114","author":"P Borowiecki","year":"2012","unstructured":"Borowiecki, P., Sidorowicz, E.: Dynamic coloring of graphs. Fundamenta Informaticae 114(2), 105\u2013128 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Coudert, O.: Exact coloring of real-life graphs is easy. In Proc. 34th Design Autom. Conf., pp. 121\u2013126. ACM (1997)","DOI":"10.1145\/266021.266047"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J., Blanton, M. (eds.) Algorithms and Theory of Computation Handbook. Chapman & Hall\/CRC (2010)","DOI":"10.1201\/9781584888239-c9"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Finocchi, I., Italiano, P.: Dynamic graphs. In: Mehta, D., Sahni, S. (eds.) Handbook on Data Structures and Applications, Computer and Information Science. CRC Press (2005)","DOI":"10.1201\/9781420035179.ch36"},{"key":"9_CR7","unstructured":"Dutot, A., Guinand, F., Olivier, D., Pign\u00e9, Y.: On the decentralized dynamic graph-coloring problem. In: Proc. Worksh. Compl. Sys. and Self-Org. Mod. (2007)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M.: Parallel and on-line graph coloring. J. Alg. 23(2), 265\u2013280 (1997)","DOI":"10.1006\/jagm.1996.0836"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(94)90157-0","volume":"130","author":"MM Halld\u00f3rsson","year":"1994","unstructured":"Halld\u00f3rsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theo. Comp. Sci. 130(1), 163\u2013174 (1994)","journal-title":"Theo. Comp. Sci."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D.: A subquadratic-time algorithm for decremental single-source shortest paths. In Proc. 25th ACM-SIAM Symp. on Discr. Alg., pp. 1053\u20131072 (2014)","DOI":"10.1137\/1.9781611973402.79"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., De Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Kapron, B.M., King, V., Mountjoy, B.: Dynamic graph connectivity in polylogarithmic worst case time. In Proc. 24th ACM-SIAM Symp. on Discr. Alg., pp. 1131\u20131142 (2013)","DOI":"10.1137\/1.9781611973105.81"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1\u20133","key":"9_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","volume":"75","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L., Saks, M.E., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discr. Math. 75(1\u20133), 319\u2013325 (1989)","journal-title":"Discr. Math."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59\u201368 (1995)","DOI":"10.1002\/net.3230250205"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Ouerfelli, L., Bouziri, H.: Greedy algorithms for dynamic graph coloring. In: Proc. Int. Conf. on Comm., Comp. and Control App., pp. 1\u20135 (2011)","DOI":"10.1109\/CCCA.2011.6031437"},{"key":"9_CR17","unstructured":"Preuveneers, D., Berbers, Y.: ACODYGRA: an agent algorithm for coloring dynamic graphs. In: Symb. Num. Alg. Sci. Comp., pp. 381\u2013390 (2004)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. In: Proc. 43rd IEEE Sym. Found. Comp. Sci., pp. 679\u2013688 (2002)","DOI":"10.1109\/SFCS.2002.1181993"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Roditty, L., Zwick, U.: Dynamic approximate all-pairs shortest paths in undirected graphs. In: Proc. 45th IEEE Sym. Found. Comp. Sci., pp. 499\u2013508 (2004)","DOI":"10.1109\/FOCS.2004.22"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Fully-dynamic min-cut. Combinatorica 27(1), 91\u2013127 (2007)","DOI":"10.1007\/s00493-007-0045-2"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Vishwanathan, S.: Randomized online graph coloring. J. Alg. 13(4), 657\u2013669 (1992)","DOI":"10.1016\/0196-6774(92)90061-G"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comp. 3, 103\u2013128 (2007)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T01:33:55Z","timestamp":1750469635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}