Duc A. Hoang

activity

20142026

most citedOn Reconfiguration Graphs of Independent Sets under Token Sliding

6 citations · 17 across the 13 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2017★ 3 cited

Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs

Duc A. Hoang, Ryuhei Uehara

Given two independent sets $I, J$ of a graph $G$ , and imagine that a token (coin) is placed at each vertex of $I$ . The Sliding Token problem asks if one could transform $I$ to $J$ …

cs.DM2014★ 1 cited

Linear-Time Algorithm for Sliding Tokens on Trees

Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein +6

Suppose that we are given two independent sets $I_{b}$ and $I_{r}$ of a graph such that $∣ I_{b} ∣ = ∣ I_{r} ∣$ , and imagine that a token is placed on each vertex in $I_{b}$ . Then, the sliding tok…