Self-stabilizing depth-first search

Zeev Collin; Shlomi Dolev

doi:10.1016/0020-0190(94)90103-1

Self-stabilizing depth-first search

Zeev Collin, Shlomi Dolev

Research output: Contribution to journal › Article › peer-review

92 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 language	English
Pages (from-to)	297-301
Number of pages	5
Journal	Information Processing Letters
Volume	49
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(94)90103-1
State	Published - 22 Mar 1994
Externally published	Yes

Keywords

Distributed computing
Fault tolerance

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/0020-0190(94)90103-1

Cite this

@article{72b8f7b2697c4ba68ff3c268a935d9d8,

title = "Self-stabilizing depth-first search",

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.",

keywords = "Distributed computing, Fault tolerance",

author = "Zeev Collin and Shlomi Dolev",

year = "1994",

month = mar,

day = "22",

doi = "10.1016/0020-0190(94)90103-1",

language = "English",

volume = "49",

pages = "297--301",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Self-stabilizing depth-first search

AU - Collin, Zeev

AU - Dolev, Shlomi

PY - 1994/3/22

Y1 - 1994/3/22

N2 - 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.

AB - 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.

KW - Distributed computing

KW - Fault tolerance

UR - http://www.scopus.com/inward/record.url?scp=0028385078&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(94)90103-1

DO - 10.1016/0020-0190(94)90103-1

M3 - Article

AN - SCOPUS:0028385078

SN - 0020-0190

VL - 49

SP - 297

EP - 301

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

Self-stabilizing depth-first search

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this