2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (2012)
Shanghai, China China
May 21, 2012 to May 25, 2012
We here present two probabilistic edge coloring algorithms for a message passing model of distributed computing. The algorithms use a simple automata for finding a matching on a graph to produce the colorings. Our first algorithm for edge coloring finds an edge coloring of a graph which is guaranteed to use no more than 2? - 1 colors and completes in O(?) communication rounds using only one hop information, where ? is the greatest degree of the graph. Our second algorithm finds a strong edge coloring of a symmetric digraph in O(?) communication rounds, using only one hop information.
Color, Automata, Message passing, Probabilistic logic, Computational modeling, Complexity theory, Solids, Distributed Algorithms, Graph Algorithms, Edge Coloring, Strong Edge Coloring, Directed Edge Coloring
J. P. Daigle and S. K. Prasad, "Two Edge Coloring Algorithms Using a Simple Matching Discovery Automata," 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum(IPDPSW), Shanghai, China China, 2012, pp. 1754-1761.