1. Distributed coloring of the graph edges
- Author
-
Hesam Omranpour, Mohammad Mehdi Ebadzadeh, Mohammad Shojafar, and Siamak Barzegar
- Subjects
Graph labeling ,Computer Networks and Communications ,Computer science ,Mixed graph ,Strength of a graph ,Distributing ,Edge coloring ,Graph ,Multi-agent ,Parallel ,Artificial Intelligence ,Semi-symmetric graph ,law.invention ,Combinatorics ,symbols.namesake ,law ,Line graph ,Graph minor ,Graph coloring ,Complement graph ,Pseudoforest ,Multigraph ,Voltage graph ,Topological graph ,Hypercube graph ,Planar graph ,Path (graph theory) ,Cycle graph ,symbols ,Algorithm design ,Force-directed graph drawing ,Multiple edges ,Fractional coloring ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
In this article an algorithm is presented for edges coloring of the graph. In this algorithm the node that we discuss represented by an Agent and then all the nodes of a graph like multi-agent system. Each node independently colours its edges with respect to cellular automata using distributed and paralleling of the process. Innovation of this method is on distributing of the process for each node so that each node updates its edges color only with the use of its neighbors in some steps until all graphs are colored completely. At the end the results are being tested on some Standard graphs and the results are presented. In this method, each graph is colored using one rule repetition for each node with high speed on its edges.
- Published
- 2008