A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
DOI10.1016/J.IPL.2015.05.010zbMATH Open1331.68155OpenAlexW1646839257MaRDI QIDQ2353636FDOQ2353636
Authors: Brahim Neggazi, Mohammed Haddad, H. Kheddouci 
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
Recommendations
- A \(O(m)\) self-stabilizing algorithm for maximal triangle partition of general graphs
- Self-stabilizing deterministic network decomposition
- scientific article; zbMATH DE number 2114409
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
graph algorithmsdistributed systemsfault tolerancegraph decompositionself-stabilizationgeneralized matchinguniform stars
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Graph designs and isomorphic decomposition (05C51)
Cites Work
- On the Complexity of General Graph Factor Problems
- Balanced graph partitioning
- Robust self-stabilizing weight-based clustering algorithm
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- On the completeness of a generalized matching problem
- Decomposition of complete graphs into stars
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Star factorizations of graph products
- A self-stabilizing algorithm for maximal matching
- Linear time self-stabilizing colorings
- A self-stabilizing algorithm for coloring planar graphs
- Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
- A new self-stabilizing maximal matching algorithm
- Maximal matching stabilizes in time \(O(m)\)
- Self-stabilizing deterministic network decomposition
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- Linear star decomposition of lobster
Cited In (4)
This page was built for publication: A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353636)
