The Schorr-Waite marking algorithm revisited
Open Access
- 18 November 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (3) , 141-143
- https://doi.org/10.1016/0020-0190(80)90130-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Studies in abstract/concrete mappings in proving algorithm correctnessPublished by Springer Nature ,1979
- The Schorr-Waite graph marking algorithmActa Informatica, 1979
- The correctness of the Schorr-Waite list marking algorithmActa Informatica, 1979
- The evolution of list-copying algorithms and the need for structured program verificationPublished by Association for Computing Machinery (ACM) ,1979
- A note on the nonrecursive traversal of binary treesThe Computer Journal, 1977
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967