The local nature of Δ-coloring and its algorithmic applications
暂无分享,去创建一个
[1] Michael Luby. Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..
[2] Richard M. Karp,et al. Probabilistic recurrence relations , 1994, JACM.
[3] Andrew V. Goldberg,et al. Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..
[5] Aravind Srinivasan,et al. Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.
[6] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .
[7] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[8] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.
[9] Howard J. Karloff. An NC Algorithm for Brooks' Theorem , 1989, Theor. Comput. Sci..
[10] Endre Szemerédi,et al. Brooks Coloring in Parallel , 1990, SIAM J. Discret. Math..
[11] Bela Bollobas,et al. Graph theory , 1979 .
[12] Joseph Naor,et al. A Fast Parallel Algorithm to Color a Graph with Delta Colors , 1988, J. Algorithms.
[13] Andrew V. Goldberg,et al. Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..