Browsing by Issue Date

Now showing items 1-2 of 2

Parameterized Complexity of the Th+1 -Free Edge Deletion Problem

GAIKWAD, AJINKYA; MAITY, SOUMEN (Springer Nature, 2023-09)

Given an undirected graph G=(V,E) and two integers k and h, we study Th+1 -FREE EDGE DELETION, where the goal is to remove at most k edges such that the resulting graph does not contain any tree on h+1 vertices as a ...
Parameterized Complexity of the -Free Edge Deletion Problem Th+1

GAIKWAD, AJINKYA; MAITY, SOUMEN (Springer Nature, 2023-09)

Given an undirected graph and two integers k and h, we study -FREE EDGE DELETION, where the goal is to remove at most k edges such that the resulting graph does not contain any tree on vertices as a (not necessarily ...

Now showing items 1-2 of 2

Search Repository