May 10, 2014 · The reconfiguration version of a vertex-subset problem Q asks whether it is possible to transform one feasible solution for Q into another in at ...

Dec 3, 2014 · The reconfiguration version of a vertex-subset problem asks whether it is possible to transform one feasible solution for into another in at ...

Our algorithms rely on dynamic programming over graphs of bounded treewidth. A tree decomposition of a graph G is a pair T = (T,χ), where T is a tree and χ is a ...

To prove the latter result, we introduce a useful technique which allows us to circumvent cardinality constraints and define reconfiguration problems in monadic ...

It is shown that the reconfiguration versions of most vertex- subset problems remain PSPACE-complete on graphs of treewidth at most $t$ but are ...

May 10, 2014 · Our algorithms rely on dynamic programming over graphs of bounded treewidth. A tree decomposition of a graph G = (V,E) is a pair T = (T,χ),.

We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is de nable in monadic second-order logic (MSOL) ...

Aug 13, 2018 · Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna: Reconfiguration over tree decompositions. CoRR abs/1405.2447 (2014).

To prove the latter result, we introduce a technique which allows us to circumvent cardinality constraints and define reconfiguration problems in MSOL.

The average and the maximum are over the best results of each configuration per instance. When no value is reported, it means the configuration was excluded ...