Subject

Now showing items 1-2 of 2

Parameterized Complexity of the Hiding Leader problem

KARRA, MOHAN (2023-01)

In this thesis, we study the theory of parametrized complexity and examine parameterized complexity of the Hiding Leader problem. We discuss standard tools and techniques for showing the fixed-parameter tractability of ...
Self-Complementarity and the Erdos-Hajnal Conjecture

NEVE, MIHIR (2023-04)

In this thesis, we take a closer look at the Erdos-Hajnal Conjecture. A Graph $H$ is said to have the Erdos-Hajnal (EH) property if, for some constant $\gamma(H) > 0$, every sufficiently large $H$-free graph $G$ has a ...

Now showing items 1-2 of 2

Search Repository