On the public citation graph
A uniform self-stabilizing minimum diameter spanning tree algorithm
0 signed · 38 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-54891-2_8openalex-snapshot
On shortest networks for classes of points in the plane
inferredcites →https://doi.org/10.1007/3-540-56188-9_14openalex-snapshot
Memory adaptive self-stabilizing protocols (extended abstract)
inferredcites →https://doi.org/10.1007/bf02278851openalex-snapshot
Self-stabilization of dynamic systems assuming only read/write atomicity
inferredcites →https://doi.org/10.1007/bf02278852openalex-snapshot
Self-stabilizing extensions for meassage-passing systems
inferredcites →https://doi.org/10.1007/bfb0020443openalex-snapshot
Self-stabilization by local checking and global reset
inferredcites →https://doi.org/10.1007/bfb0022152openalex-snapshot
A uniform self-stabilizing minimum diameter spanning tree algorithm
inferredcites →https://doi.org/10.1007/bfb0022445openalex-snapshot
Uniform dynamic self-stabilizing leader election
inferredcites →https://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferredcites →https://doi.org/10.1016/0376-5075(83)90034-xopenalex-snapshot
Fault-tolerant broadcast of routing information
inferredcites →https://doi.org/10.1016/0377-2217(80)90164-2openalex-snapshot
Complexity of spanning tree problems: Part I
inferredcites →https://doi.org/10.1057/jors.1976.202openalex-snapshot
Graph Theory: An Algorithmic Approach
inferredcites →https://doi.org/10.1109/71.588622openalex-snapshot
Uniform dynamic self-stabilizing leader election
inferredcites →https://doi.org/10.1109/eeis.1989.720145openalex-snapshot
Self-Stabilization of the Alternating-Bit Protocol
inferredcites →https://doi.org/10.1109/fscs.1990.89570openalex-snapshot
Communication-optimal maintenance of replicated information
inferredcites →https://doi.org/10.1109/reldis.1989.72751openalex-snapshot
Self-stabilization of the alternating-bit protocol
inferredcites →https://doi.org/10.1109/tcom.1979.1094552openalex-snapshot
A Failsafe Distributed Routing Protocol
inferredcites →https://doi.org/10.1137/0220060openalex-snapshot
Minimum Diameter Spanning Trees and Related Problems
inferredcites →https://doi.org/10.1142/s0129626498000043openalex-snapshot
Optimal Time Self-Stabilization in Uniform Dynamic Systems
inferredcites →https://doi.org/10.1145/112600.112624openalex-snapshot
Resource bounds for self stabilizing message driven protocols
inferredcites →https://doi.org/10.1145/167088.167256openalex-snapshot
Time optimal self-stabilizing synchronization
inferredcites →https://doi.org/10.1145/197917.198102openalex-snapshot
Self-stabilization by counter flushing
inferredcites →https://doi.org/10.1145/28395.28421openalex-snapshot
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/93385.93405openalex-snapshot
Self-stabilizing extensions for message-passing systems
inferredcites →https://doi.org/10.21236/ada061666openalex-snapshot
A Failsafe Distributed Routing Protocol
inferredcites →https://doi.org/10.4236/ajcm.2018.83016openalex-snapshot
Minimum Diameter Spanning Tree
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_11openalex-snapshot
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks
inferred← citeshttps://doi.org/10.1007/s00453-014-9913-5openalex-snapshot
Maximum Metric Spanning Tree Made Byzantine Tolerant
inferred← citeshttps://doi.org/10.1007/s10878-011-9383-5openalex-snapshot
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.03.009openalex-snapshot
A distributed algorithm for constructing a minimum diameter spanning tree
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.08.019openalex-snapshot
Self-stabilizing minimum degree spanning tree within one from the optimal degree
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.02.007openalex-snapshot
A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161042openalex-snapshot
Self-stabilizing minimum-degree spanning tree within one from the optimal degree
inferred← citeshttps://doi.org/10.70675/4dd5235dz9812z49bbz9e4fz9d3dc8334ee6openalex-snapshot
Algorithmes de structuration et de collecte de donnés électriques, application à la détection du vol d’électricité sur le réseau de la SNE
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
inferred← citeshttps://doi.org/10.70675/719d1158z543fz4588za1c8z3f0be6ffc26fopenalex-snapshot
Auto-organisation et routage dans les réseaux mobiles ad hoc
showing the first 10 of 11 · page through all 11
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.