Brahim Neggazi
Mohammed Haddad
ABSTRACT
The graph decomposition problem consists of dividing a graph into components, patterns or partitions which satisfy some specifications. In this paper, we give interest to graph decomposition into particular patterns: disjoint paths of length two. We present the first Self-stabilizing algorithm for finding a Maximal Decomposition of an arbitrary graph into disjoint Paths of length two (SMDP). Then, we give the correctness proof and we show that SMDP converges in O(Δm) moves where m is the number of edges and Δ the maximum degree in the graph G.
- K. Andreev and H. Räcke. Balanced graph partitioning. In SPAA Conference Proceedings, pages 120--124, 2004. Google Scholar
Digital Library
- F. Belkouch, M. Bui, L. Chen, and A. K. Datta. Self-stabilizing deterministic network decomposition. J. Parallel Distrib. Comput., 62(4):696--714, 2002. Google ScholarDigital Library
- L. Blin, M. G. Potop-Butucaru, S. Rovedakis, and S. Tixeuil. Loop-free super-stabilizing spanning tree construction. In SSS Conference Proceedings, pages 50--64, 2010. Google ScholarDigital Library
- E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643--644, 1974. Google ScholarDigital Library
- S. Dubois and S. Tixeuil. A taxonomy of daemons in self-stabilization. CoRR, abs/1110.0334, 2011.Google Scholar
- N. Guellati and H. Kheddouci. A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput., (4):406--415, Apr. 2010. Google ScholarDigital Library
- H. Ishii and H. Kakugawa. A self-stabilizing algorithm for finding cliques in distributed systems. IEEE Symp. on Reliable Distributed Systems, page 390, 2002. Google ScholarDigital Library
- B. Neggazi, M. Haddad, and H. Kheddouci. Self-stabilizing algorithm for maximal graph partitioning into triangles. In SSS, pages 31--42, 2012. Google ScholarDigital Library
- A. Pothen. Graph partitioning algorithms with applications to scientific computing. Technical report, Norfolk, VA, USA, 1997. Google ScholarDigital Library
- B. Serrour, A. Arenas, and S. Gomez. Detecting communities of triangles in complex networks using spectral optimization. Computer Communications, 34(5):629--634, 2011. Google ScholarDigital Library
Index Terms
- Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length
Recommendations
Decompositions of triangle-free 5-regular graphs into paths of length five
A P k -decomposition of a graph G is a set of edge-disjoint paths with k edges that cover the edge set of G . Kotzig (1957) proved that a 3-regular graph admits a P 3 -decomposition if and only if it contains a perfect matching. Kotzig also asked what ...
Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter
An almost complete tripartite graph K@?"m"""1","m"""2","m"""3 is obtained by removing an edge from the complete tripartite graph K"m"""1","m"""2","m"""3. A graph that can be decomposed into two isomorphic factors of diameter d is d-halvable. Froncek ...
A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
We address the decomposition of graphs into stars in a distributed way.We propose a new self-stabilizing algorithm for decomposing arbitrary graphs into stars having same size.The proposed algorithm has polynomial moves complexity.Formal proofs for ...
Comments