A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
B Neggazi, M Haddad, H Kheddouci - Information Processing Letters, 2015 - Elsevier
A p-star is a complete bipartite graph K 1, p with one center node and p leaves. In this paper,
we propose a polynomial self-stabilizing algorithm for maximal graph decomposition into p-
stars. Given an arbitrary graph G and a positive integer p⩾ 1, this decomposition provides
disjoint components of G, such that each component induces a p-star in G. Under the unfair
distributed scheduler, the algorithm converges within O (Δ 2 m) moves where m is the
number of edges and Δ is maximum node degree in the graph G.
we propose a polynomial self-stabilizing algorithm for maximal graph decomposition into p-
stars. Given an arbitrary graph G and a positive integer p⩾ 1, this decomposition provides
disjoint components of G, such that each component induces a p-star in G. Under the unfair
distributed scheduler, the algorithm converges within O (Δ 2 m) moves where m is the
number of edges and Δ is maximum node degree in the graph G.
[引用][C] A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
N Brahim, M Haddad, H Kheddouci - Information Processing Letters, 2015 - hal.science
A new self-stabilizing algorithm for maximal p-star decomposition of general graphs -
Archive ouverte HAL …
Archive ouverte HAL …
以上显示的是最相近的搜索结果。 查看全部搜索结果