Loading...
Please wait, while we are loading the content...
Similar Documents
A robust distributed generalized matching protocol that stabilizes in linear time (2003).
| Content Provider | CiteSeerX |
|---|---|
| Author | Goddard, Wayne Hedetniemi, Stephen T. Jacobs, David P. Srimani, Pradip K. |
| Abstract | We present a self-stabilizing algorithm for finding a generalized maximal matching (#-matching) in an arbitrary distributed network. We show that the algorithm converges in #### moves under an unfair central demon independent of the #-values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2]. |
| File Format | |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Linear Time Robust Distributed Generalized Matching Protocol Multiple Type Arbitrary Distributed Network Maximal Matching Self-stabilizing Algorithm Recent Algorithm Algorithm Converges Different Node |
| Content Type | Text |