Two distributed algorithms for finding matchings on a graph.
Two new distributed algorithms for finding matchings on a graph are presented. The first algorithm generates a spanning matching. A spanning matching on a graph is one with respect to which no two adjacent nodes are both free. Starting from any matching, the second algorithm proceeds in phases until...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Published: |
University of Ottawa (Canada)
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/10393/5970 http://dx.doi.org/10.20381/ruor-11024 |