8 citations · 36 across the 49 of their papers we have counts for
Showing 2014 · cs.DMShow all
2 papers · 2 filters
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 and of a graph such that , and imagine that a token is placed on each vertex in . Then, the sliding tok…
cs.DM2014
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
Yota Otachi, Pascal Schweitzer
We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to ob…