On the public citation graph
Robust Self-stabilizing Clustering Algorithm
0 signed · 34 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/11963271_8openalex-snapshot
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks
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.1007/bf01200845openalex-snapshot
Multicluster, mobile, multimedia radio network
inferredcites →https://doi.org/10.1023/a:1013941929408openalex-snapshot
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/49.622910openalex-snapshot
Adaptive clustering for mobile wireless networks
inferredcites →https://doi.org/10.1109/icdcs.1999.776551openalex-snapshot
Self-stabilizing neighborhood synchronizer in tree networks
inferredcites →https://doi.org/10.1109/icdcsw.2005.122openalex-snapshot
Self-Stabilization in Self-Organized Multihop Wireless Networks
inferredcites →https://doi.org/10.1109/infcom.2001.916296openalex-snapshot
A clustering scheme for hierarchical control in multi-hop wireless networks
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.1109/ipdps.2006.1639550openalex-snapshot
A self-stabilizing minimal dominating set algorithm with safe convergence
inferredcites →https://doi.org/10.1109/ispan.1999.778957openalex-snapshot
Distributed clustering for ad hoc networks
inferredcites →https://doi.org/10.1109/ispan.2005.12openalex-snapshot
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/vetecf.1999.798457openalex-snapshot
Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks
inferredcites →https://doi.org/10.1109/vetecs.2003.1207525openalex-snapshot
Time and message complexities of the generalized distributed mobility-adaptive clustering (GDMAC) algorithm in wireless multihop networks
inferredcites →https://doi.org/10.1145/301308.301358openalex-snapshot
Memory space requirements for self-stabilizing leader election protocols
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/584490.584497openalex-snapshot
K-clustering in wireless ad hoc networks
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.70957openalex-snapshot
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_6openalex-snapshot
A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.12.632openalex-snapshot
Mobility Entropy-based Clusterhead Selection Algorithm for Ad Hoc Networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.05.010openalex-snapshot
A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.06.003openalex-snapshot
Silent self-stabilizing BFS tree algorithms revisited
inferred← citeshttps://doi.org/10.1093/comjnl/bxz102openalex-snapshot
Polynomial Silent Self-Stabilizing p-Star Decomposition†
inferred← citeshttps://doi.org/10.1109/atnac.2016.7878779openalex-snapshot
Energy efficient Hybrid Clustering Algorithm for Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/iscc.2010.5546612openalex-snapshot
Managing clusters among distributed dynamic environments
inferred← citeshttps://doi.org/10.1109/ispa.2008.43openalex-snapshot
Self-Stabilizing Construction of Bounded Size Clusters
inferred← citeshttps://doi.org/10.1109/ntms.2011.5720626openalex-snapshot
A Self-Stabilizing Algorithm for Stable Clustering in Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/secon.2012.6275798openalex-snapshot
Building an efficient overlay for publish/subscribe in wireless sensor networks
inferred← citeshttps://doi.org/10.4108/icst.bionetics2008.4736openalex-snapshot
A stable clustering algorithm for mobile ad hoc networks based on attractor selection
inferred← citeshttps://doi.org/10.4236/oalib.1101574openalex-snapshot
A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1011.2953openalex-snapshot
A Distributed Clustering Algorithm for Dynamic Networks
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.