Research Article
The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm
Algorithm 1
Algorithm 1 generalized Karp-Sipser (GKS).
| Require: a factor graph (, , ) | | Ensure: a set packing | | | | add to all isolated variable nodes and remove them | | from | | remove from any isolated factor node | | while is not empty do | | if has any pendant then | | choose a pendant uniformly at random | | add to | | remove from , then remove its factor neighbours | | and their variable neighbours | | else | | pick uniformly at random a variable node and add | | it to , remove it from , then remove its factor | | neighbours and their variable neighbours | | end if | | remove from any isolated factor node | | end while | | Return |
|
