Revision as of 00:59, 22 June 2006 edit McoreD (talk \| contribs) 65 edits →Dijkstra-Scholten Algorithm for Cyclic Directed Graphs ← Previous edit		Revision as of 20:44, 29 July 2006 edit undo MarshBot (talk \| contribs) 50,214 edits Adding {{linkless}} template to orphan article Next edit →
Line 1: {{linkless-date\|July 2006}} The '''Dijkstra-Scholten Algorithm''' is an [[algorithm]] for detecting [[termination]] in a [[distributed system]]. The algorithm was proposed by Dijkstra and Scholten in [[1980]].

Dijkstra–Scholten algorithm: Difference between revisions