Improved Algorithms for Edge Colouring in the W-Streaming Model
暂无分享,去创建一个
[1] Rajeev Motwani,et al. The Greedy Algorithm is Optimal for On-Line Edge Coloring , 1992, Inf. Process. Lett..
[2] Ilan Reuven Cohen,et al. Tight Bounds for Online Edge Coloring , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[3] Jayadev Misra,et al. A Constructive Proof of Vizing's Theorem , 1992, Inf. Process. Lett..
[4] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[5] Camil Demetrescu,et al. Adapting parallel algorithms to the W-Stream model, with applications to graph problems , 2007, Theor. Comput. Sci..
[6] Benjamin Doerr,et al. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , 2018, Theory of Evolutionary Computation.
[7] Anand Srivastav,et al. Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM , 2017, ArXiv.
[8] Aranyak Mehta,et al. A 1.43-competitive online graph edge coloring algorithm in the random order arrival model , 2010, SODA '10.
[9] Camil Demetrescu,et al. Trading off space for passes in graph streaming problems , 2009, SODA '06.
[10] Mohammad Taghi Hajiaghayi,et al. Streaming and Massively Parallel Algorithms for Edge Coloring , 2019, ESA.