The Schorr-Waite marking algorithm revisited
From MaRDI portal
Publication:1146527
DOI10.1016/0020-0190(80)90130-1zbMath0447.68073OpenAlexW2031195665MaRDI QIDQ1146527
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027/uiuo.ark:/13960/t3xs7927k
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Schorr-Waite graph marking algorithm
- The correctness of the Schorr-Waite list marking algorithm
- Program. construction. International summer school
- A note on the nonrecursive traversal of binary trees
- An efficient machine-independent procedure for garbage collection in various list structures
- Proving Properties of Programs by Structural Induction
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: The Schorr-Waite marking algorithm revisited