Self-stabilizing depth-first search

Zeev Collin, Shlomi Dolev

Research output: Contribution to journalArticlepeer-review

89 Scopus citations

Abstract

A distributed algorithm is self-stabilizing if it can be started from any possible global state. Once started, the algorithm converges to a consistent global state by itself. This paper presents a distributed self-stabilizing Depth-First Search (DFS) spanning tree algorithm, whose output is a DFS spanning tree of the communication graph, kept in a distributed fashion.

Original languageEnglish
Pages (from-to)297-301
Number of pages5
JournalInformation Processing Letters
Volume49
Issue number6
DOIs
StatePublished - 22 Mar 1994
Externally publishedYes

Keywords

  • Distributed computing
  • Fault tolerance

Fingerprint

Dive into the research topics of 'Self-stabilizing depth-first search'. Together they form a unique fingerprint.

Cite this