Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1.

Jakob Baumann Matthias Pfretzschner Ignaz Rutter

Published in: WG (2023)

Keyphrases

parameterized complexity
bounded treewidth
fixed parameter tractable
np complete
vertex set
directed graph
conjunctive queries
undirected graph
decision problems
global constraints
relational learning
information extraction