Given a graph $G$ and two independent sets $S, T$ of $G$, the independent set reconfiguration problem is the problem to determine whether $T$ can be obtained by repleatedly removing and adding a vertex from and to $S$, while intermediate sets must be also independent. This paper proposes an algorithm for the independent set reconfiguration problem using a data structure, called zero-suppressed binary decision diagrams (ZDDs). This algorithm can be generalized to various reconfiguration problems.

翻译：鉴于图表$G$和两套独立的S美元,即T$G$,独立的一套重新配置问题是一个问题,即确定能否通过挤出和从S美元和从S美元增加一个顶点和向S美元增加一个顶点来获得$T$,而中间套也必须是独立的。本文建议使用数据结构(称为零压二进制决定图表(ZDDs))来计算独立的一套重新配置问题算法。这种算法可以推广到不同的重新配置问题中。