Distributed (δ+1)-coloring in linear (in δ) time
暂无分享,去创建一个
[1] Richard Cole,et al. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..
[2] Wayne Goddard,et al. Coloring with defect , 1997, SODA '97.
[3] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[4] Thomas Moscibroda,et al. What Cannot Be Computed Locally , 2004 .
[5] Milind Dawande,et al. Link scheduling in sensor networks: distributed edge coloring revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[6] Aravind Srinivasan,et al. On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.
[7] Serge A. Plotkin,et al. Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems , 1987 .
[8] Aravind Srinivasan,et al. Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.
[9] Öjvind Johansson. Simple Distributed Delta+1-coloring of Graphs , 1999, Inf. Process. Lett..
[10] Beat Gfeller,et al. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs , 2007, PODC '07.
[11] Seyed Hossein Hosseini,et al. Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm , 1990, J. Parallel Distributed Comput..
[12] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[13] G. Chartrand,et al. A generalization of the chromatic number , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.
[14] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .
[15] Roger Wattenhofer,et al. On the locality of bounded growth , 2005, PODC '05.
[16] Andrzej Pelc,et al. Fast distributed graph coloring with O(Δ) colors , 2001, SODA '01.
[17] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[18] Roger Wattenhofer,et al. A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.
[19] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[20] Andrew V. Goldberg,et al. Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Fabian Kuhn. Weak graph colorings: distributed algorithms and applications , 2009, SPAA '09.
[22] Alessandro Panconesi,et al. Some simple distributed algorithms for sparse networks , 2001, Distributed Computing.
[23] Moni Naor,et al. Local computations on static and dynamic graphs , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[24] Nathan Linial,et al. Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[25] Roger Wattenhofer,et al. On the complexity of distributed graph coloring , 2006, PODC '06.
[26] Serge A. Plotkin. Graph-theoretic techniques for parallel, distributed, and sequential computation , 1988 .
[27] Andrew V. Goldberg,et al. Parallel Symmetry-Breaking in Sparse Graphs , 1988, SIAM J. Discret. Math..
[28] Roger Wattenhofer,et al. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.
[29] Sundar Vishwanathan,et al. Locality based graph coloring , 1993, STOC.
[30] Roger Wattenhofer,et al. A new technique for distributed symmetry breaking , 2010, PODC '10.
[31] Douglas R. Woodall,et al. Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency , 1986, J. Graph Theory.
[32] M. Frick. A Survey of (m, k)-Colorings , 1993 .
[33] Roger Wattenhofer,et al. What cannot be computed locally! , 2004, PODC '04.
[34] Shay Kutten,et al. Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.
[35] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .