Author:
Barba Luis,Cardinal Jean,Korman Matias,Langerman Stefan,van Renssen André,Roeloffzen Marcel,Verdonschot Sander
Publisher
Springer International Publishing
Reference22 articles.
1. Baswana, S., Gupta, M., Sen, S.: Fully dynamic maximal matching in $${O}(\log n)$$ update time. SIAM J. on Comp. 44(1), 88–113 (2015)
2. Baswana, S., Khurana, S., Sarkar, S.: Fully dynamic randomized algorithms for graph spanners. ACM Trans. on Alg. 8(4), 35 (2012)
3. Borowiecki, P., Sidorowicz, E.: Dynamic coloring of graphs. Fundamenta Informaticae 114(2), 105–128 (2012)
4. Coudert, O.: Exact coloring of real-life graphs is easy. In Proc. 34th Design Autom. Conf., pp. 121–126. ACM (1997)
5. 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)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献