Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
S Yahiaoui, Y Belhoul, M Haddad… - Information Processing …, 2013 - Elsevier
We propose a self-stabilizing distributed algorithm for the minimal global powerful alliance
set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some
generalizations of the problem. Using an unfair distributed scheduler, the proposed
algorithms converge in O (mn) moves starting from an arbitrary state.
set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some
generalizations of the problem. Using an unfair distributed scheduler, the proposed
algorithms converge in O (mn) moves starting from an arbitrary state.
Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
Y Belhoul, S Yahiaoui - 2013 - dl.cerist.dz
We propose a self-stabilizing distributed algorithm for the minimal global powerful alliance
set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some
generalizations of the problem. Using an unfair distributed scheduler, the proposed
algorithms converge in O (mn) moves starting from an arbitrary state
set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some
generalizations of the problem. Using an unfair distributed scheduler, the proposed
algorithms converge in O (mn) moves starting from an arbitrary state
以上显示的是最相近的搜索结果。 查看全部搜索结果