The Schorr-Waite graph marking algorithm

DOI10.1007/BF00289068zbMath0414.68015MaRDI QIDQ599496

David Gries

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Schorr-Waite graph marking algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items (4)

Implementing (nondeterministic) parallel assignments ⋮ The Schorr-Waite marking algorithm revisited ⋮ Matching Logic: An Alternative to Hoare/Floyd Logic ⋮ The correctness of the Schorr-Waite list marking algorithm

Cites Work

• Is “sometime” sometimes better than “always”?
• An efficient machine-independent procedure for garbage collection in various list structures
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Schorr-Waite graph marking algorithm