Golden rule for container algorithms
= Golden rule for container algorithms
A container algorithm may use membership in the unknown independent set only through information recorded in its <container fingerprint>. With a deterministic ordering and deterministic tests, record every positive queried vertex; queried negative vertices can be excluded. All state updates must be recoverable from the fingerprint alone, so replaying the algorithm constructs a container without knowing the independent set.