Duc A. Hoang

activity

20182026

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2024

Directed Token Sliding

Niranka Banerjee, Christian Engels, Duc A. Hoang

Reconfiguration problems involve determining whether two given configurations can be transformed into each other under specific rules. The Token Sliding problem asks whether, given…

cs.DS2024

Distance Recoloring

Niranka Banerjee, Christian Engels, Duc A. Hoang

Reconfiguration problems ask whether one feasible solution can be transformed into another by a sequence of local moves while maintaining feasibility throughout. For integers $d \g…

cs.DS2023

The Complexity of Distance- $r$ Dominating Set Reconfiguration

Niranka Banerjee, Duc A. Hoang

For a fixed integer $r \geq 1$ , a distance- $r$ dominating set (D $r$ DS) of a graph $G = (V, E)$ is a vertex subset $D \subseteq V$ such that every vertex in $V$ is within distance $…

cs.DS2018

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders

Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara

Suppose that two independent sets $I$ and $J$ of a graph with $∣ I ∣ = ∣ J ∣$ are given, and a token is placed on each vertex in $I$ . The Sliding Token problem is t…

Directed Token Sliding

Distance Recoloring

The Complexity of Distance-r Dominating Set Reconfiguration

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders

The Complexity of Distance- $r$ Dominating Set Reconfiguration