Subject

Now showing items 1-2 of 2

The Minimum Neighbourhood Problem

JOSHI, CHINMAY (2019-04)

Given a graph G = (V,E) with n vertices and a positive integer s ≤ n, we want to find a set S ⊆ V of size s such that |N[S]| is minimum, where N[S] denotes closed neighbourhood of S. We call this problem as the minimum ...
Parameterized Algorithms for Graph Problems

MALLYA, VAIKUNT (2022-04)

The fixed parameter approach to a problem is a technique of designing an algorithm to solve combinatorially hard problems. A parameterized problem has an input instance x as well as a parameter k which is sufficiently small ...

Now showing items 1-2 of 2

Search Repository