A SELF-STABILIZING ALGORITHM FOR MAXIMAL MATCHING

[[abstract]]We present a self-stabilizing algorithm for finding a maximal matching in distributed networks. Due to its self-stabilizing property, the algorithm can automatically detect and recover from the faults caused by unexpected perturbations on local variables maintained on each node of the system. A variant function is provided to prove the correctness of the algorithm and to analyze its time complexity.[[fileno]]2030249010017[[department]]資訊工程學