Subject

Sort by: Order: Results:

  • Exact Exponential Algorithms to solve NP-Hard Problems 
    DARSAN, T I (27-05)
    The first part of the thesis is mainly a literature study of the book, ”Exact Exponential Algorithms” by Fomin and Krastch. We explain different techniques to solve computational problems through exact algorithms. The ...
  • The Graphs Associated with Ordered Structures and Algebraic Structures 
    GONDE, SAMRUDDHA (2018-05)
    This project focuses on the interplay between the zero-divisor graphs of semigroups and zero-divisor graphs of meet-semilattices. Mainly, we examine the weakly perfectness of the zero-divisor graphs of semigroups and ...
  • 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 ...
  • Symbolic Regression of Dynamic Network Models 
    GANDHI, GOVIND (2022-05)
    Growing interest in modelling complex systems from brains to societies to cities using networks has led to increased efforts to describe generative processes that explain those networks. Recent successes in machine learning ...
  • 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 ...
  • Vertex Deletion on Chordal Graphs and Their Subclasses 
    RACHURI, ANIRUDH RAGHAVA (2023-05)
    Numerous computational problems on graphs remain computationally intractable and are termed NP-complete problems. In this thesis, we study one of the ways to tackle this issue: we restrict the input graphs by specifying ...

Search Repository


Advanced Search

Browse

My Account