The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper studies the computational complexity of the problem (), when the input graph
is a colored caterpillar, parameterized by hair length. In order prove our
result we establish a close relationship between the and
a graph layout problem the
().
We show a dichotomy: the and the
are NP-complete for colored caterpillars of hair length 2, while both problems are in P for colored caterpillars
of hair length 2.
For the hardness results we provide a reduction from the , while the polynomial...
Download Results (CSV)