The Schorr-Waite marking algorithm revisited

DOI10.1016/0020-0190(80)90130-1zbMath0447.68073OpenAlexW2031195665MaRDI QIDQ1146527

Nachum Dershowitz

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

zbMATH Keywords

program transformationprogram correctnessSchorr-Waite marking algorithm

Mathematics Subject Classification ID

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

Related Items (1)

A study of binary tree traversal algorithms and a tag-free threaded representation

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