DeepAI AI Chat
Log In Sign Up

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems

by   Takehiro Ito, et al.
Kyoto University

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.


page 1

page 2

page 3

page 4


Extremal Independent Set Reconfiguration

The independent set reconfiguration problem asks whether one can transfo...

Incremental Optimization of Independent Sets under Reachability Constraints

We introduce a new framework for reconfiguration problems, and apply it ...

Finding Independent Transversals Efficiently

We give an efficient algorithm that, given a graph G and a partition V_1...

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders

Suppose that two independent sets I and J of a graph with I = J are ...

DIAS: A Domain-Independent Alife-Based Problem-Solving System

A domain-independent problem-solving system based on principles of Artif...

A New Algorithm for the Robust Semi-random Independent Set Problem

In this paper, we study a semi-random version of the planted independent...