Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey on the parameterized complexity of reconfiguration problems
A graph vertex-subset problem defines which subsets of the vertices of an input graph are
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
N Bousquet, AE Mouawad, N Nishimura… - ar**
Abstract In the Token Jum** problem we are given a graph G=(V, E) and two independent
sets S and T of G, each of size k≥ 1. The goal is to determine whether there exists a …
sets S and T of G, each of size k≥ 1. The goal is to determine whether there exists a …
Reconfiguration of spanning trees with many or few leaves
Let $ G $ be a graph and $ T_1, T_2 $ be two spanning trees of $ G $. We say that $ T_1 $
can be transformed into $ T_2 $ via an edge flip if there exist two edges $ e\in T_1 $ and $ f …
can be transformed into $ T_2 $ via an edge flip if there exist two edges $ e\in T_1 $ and $ f …
Broadcasting in split graphs
Broadcasting is an information dissemination primitive where a message is passed from one
node (called originator) to all other nodes in the network. With the increasing interest in …
node (called originator) to all other nodes in the network. With the increasing interest in …
Independent set reconfiguration parameterized by modular-width
Abstract Independent Set Reconfiguration is one of the most well-studied problems in the
setting of combinatorial reconfiguration. It is known that the problem is PSPACE-complete …
setting of combinatorial reconfiguration. It is known that the problem is PSPACE-complete …
Algorithmic meta-theorems for combinatorial reconfiguration revisited
T Gima, T Ito, Y Kobayashi, Y Otachi - Algorithmica, 2024 - Springer
Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration
problem asks whether we can reach one vertex set from the other by repeating prescribed …
problem asks whether we can reach one vertex set from the other by repeating prescribed …