A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
DOI10.1016/j.ipl.2015.05.010zbMath1331.68155OpenAlexW1646839257MaRDI QIDQ2353636
Mohammed Haddad, Hamamache Kheddouci, Brahim Neggazi
Publication date: 15 July 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.05.010
distributed systemsfault tolerancegraph algorithmsgraph decompositionself-stabilizationgeneralized matchinguniform stars
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Graph designs and isomorphic decomposition (05C51)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Self-stabilizing deterministic network decomposition
- Balanced graph partitioning
- Robust self-stabilizing weight-based clustering algorithm
- A new self-stabilizing maximal matching algorithm
- Linear time self-stabilizing colorings
- A self-stabilizing algorithm for maximal matching
- A self-stabilizing algorithm for coloring planar graphs
- Maximal matching stabilizes in time \(O(m)\)
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- Star factorizations of graph products
- On the Complexity of General Graph Factor Problems
- Fast Self-stabilizing Minimum Spanning Tree Construction
- Self-stabilizing systems in spite of distributed control
- On the completeness of a generalized matching problem
- Decomposition of complete graphs into stars
This page was built for publication: A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
