On the public citation graph
A self-stabilizing minimal dominating set algorithm with safe convergence
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45032-7_10openalex-snapshot
A Framework of Safe Stabilization
inferredcites →https://doi.org/10.1007/3-540-45032-7_14openalex-snapshot
Route Preserving Stabilization
inferredcites →https://doi.org/10.1007/978-3-540-24604-6_3openalex-snapshot
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
inferredcites →https://doi.org/10.1016/s0898-1221(03)90143-xopenalex-snapshot
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
inferredcites →https://doi.org/10.1109/ipdps.2003.1213302openalex-snapshot
Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks
inferredcites →https://doi.org/10.1145/248052.248057openalex-snapshot
Fault-containing self-stabilizing algorithms
inferredcites →https://doi.org/10.1145/311531.311532openalex-snapshot
Fundamentals of fault-tolerant distributed computing in asynchronous environments
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.7902openalex-snapshot
A self‐stabilizing distributed algorithm for the bounded lattice domination problems under the distance‐2 model
inferred← citeshttps://doi.org/10.1007/11945529_29openalex-snapshot
Robust Self-stabilizing Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/11945529_30openalex-snapshot
Self-stabilizing Wireless Connected Overlays
inferred← citeshttps://doi.org/10.1007/978-3-030-02738-4_15openalex-snapshot
Game-Theoretic Approach to Self-stabilizing Minimal Independent Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-02013-1openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_18openalex-snapshot
An Asynchronous Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_5openalex-snapshot
Self-stabilizing (f,g)-Alliances with Safe Convergence
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_26openalex-snapshot
Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_43openalex-snapshot
Gradual Stabilization Under $$\tau $$-Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_31openalex-snapshot
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
inferred← citeshttps://doi.org/10.1007/978-3-642-15277-1_51openalex-snapshot
Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-16023-3_7openalex-snapshot
Loop-Free Super-Stabilizing Spanning Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_6openalex-snapshot
Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.11.006openalex-snapshot
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.09.004openalex-snapshot
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.02.001openalex-snapshot
Self-stabilizing (f,g) -alliances with safe convergence
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.06.003openalex-snapshot
Silent self-stabilizing BFS tree algorithms revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.009openalex-snapshot
Robust self-stabilizing weight-based clustering algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.007openalex-snapshot
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
inferred← citeshttps://doi.org/10.1109/candar68384.2025.00015openalex-snapshot
A self-stabilizing algorithm for the dynamic total domination problem
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00045openalex-snapshot
Self-Stabilizing Distributed Cooperative Reset
inferred← citeshttps://doi.org/10.1109/icnc.2011.68openalex-snapshot
Self-Stabilization in Unstable Network Environments
inferred← citeshttps://doi.org/10.1109/iih-msp.2014.186openalex-snapshot
Self-Stabilizing Distributed Formation of Minimal k-Dominating Sets in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00093openalex-snapshot
MULTISKIPGRAPH: A Self-Stabilizing Overlay Network that Maintains Monotonic Searchability
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00114openalex-snapshot
A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.86openalex-snapshot
Self-Stabilizing Algorithm for Maximal 2-Packing with Safe Convergence in an Arbitrary Graph
inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00106openalex-snapshot
A Self-Stabilizing Algorithm for the Local (1,|Ni|)-Critical Section Problem with Safe Convergence
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644642openalex-snapshot
A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence
inferred← citeshttps://doi.org/10.1109/srds.2009.13openalex-snapshot
A Self-Stabilizing O(n)-Round k-Clustering Algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2013.2297100openalex-snapshot
Game-Theoretic Approach to Self-Stabilizing Distributed Formation of Minimal Multi-Dominating Sets
inferred← citeshttps://doi.org/10.1109/wiiat50758.2020.00012openalex-snapshot
An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1145/3288599.3288609openalex-snapshot
Benefit of self-stabilizing protocols in eventually consistent key-value stores
inferred← citeshttps://doi.org/10.15803/ijnc.5.1_105openalex-snapshot
Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.108openalex-snapshot
Self-Stabilization in Dynamic Networks
inferred← citeshttps://doi.org/10.2200/s00908ed1v01y201903dct015openalex-snapshot
Introduction to Distributed Self-Stabilizing Algorithms
inferred← citeshttps://doi.org/10.3390/electronics11030300openalex-snapshot
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/90openalex-snapshot
On the Limits and Practice of Automatically Designing Self-Stabilization
inferred← citeshttps://doi.org/10.70675/6da8d938zde89z4bffzb535zed8657b6e60bopenalex-snapshot
Vers une structuration auto-stabilisante des réseaux ad hoc : cas des réseaux de capteurs sans fil
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.