A self-stabilizing algorithm for maximal matching
Information Processing Letters
Maximal matching stabilizes in quadratic time
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Maximal matching stabilizes in time O(m)
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Self-stabilizing deterministic network decomposition
Journal of Parallel and Distributed Computing
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Graph Partitioning Algorithms with Applications to Scientific Computing
Graph Partitioning Algorithms with Applications to Scientific Computing
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
An optimal self-stabilizing strarvation-free alternator
Journal of Computer and System Sciences
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
Computer Communications
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Journal of Parallel and Distributed Computing
Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Detecting communities of triangles in complex networks using spectral optimization
Computer Communications
Brief announcement: a stabilizing algorithm for finding two edge-disjoint paths in arbitrary graphs
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
The graph partitioning problem consists of dividing a graph into parts, patterns or partitions which satisfy some specifications. Graph partitioning problems are known to be NP-complete. In this paper, we focus on the particular pattern of triangles and present the first Self-stabilizing algorithm for Maximal Partitioning of arbitrary graphs into Triangles (MPT). Then, we give the correctness and convergence proofs of the proposed algorithm.