The Schorr-Waite graph marking algorithm

DOI10.1007/BF00289068MaRDI QIDQ599496zbMATH OpenFDO

Authors David Gries

Publication date 1979

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00289068

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)

Cites work

• An axiomatic basis for computer programming
• An efficient machine-independent procedure for garbage collection in various list structures
• scientific article; zbMATH DE number 3469999 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Is “sometime” sometimes better than “always”?

Cited in

(4)

• The Schorr-Waite marking algorithm revisited
• The correctness of the Schorr-Waite list marking algorithm
• Implementing (nondeterministic) parallel assignments
• Matching logic: an alternative to Hoare/Floyd logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q599496)