Advisor

Sort by: Order: Results:

  • Graph AlgorithMS using Rank and Determinant 
    PRADHAN, VIVEK (2013-05)
    Algebraic algorithms are important since they provide elegant and easy solutions to many problems. Even though most fast algorithms for graph problems exploit graphs structure or combinatorial properties, in some situations ...
  • Matching Under Preferences 
    ADIL, DEEKSHA (2017-04)
    The Stable Marriage Problem is a classic problem of matching under preferences. It involves two sets of agents, classically refered to as men and women each having a preference list over the other set. A matching is a ...
  • Lossy Kernels for Few Graph Contraction ProbleMS 
    GUNDA, SPOORTHY (2019-04)
    We study a few graph contraction problems Chordal Contraction, Clique Contraction and Split Contraction, from the viewpoint of Lossy Kernelization, which is a recently introduced framework to study NP-hard problems. ...
  • ProbleMS on Temporal Graphs 
    V M, VISHNU VARDHAN (2019-04)
    The idea of temporal graphs can be thought of as a recent addition to the extensively researched concept of graph theory. The advent of cheap wireless communication devices and need of efficient communication protocols, ...
  • Parameterized Complexity of Fair Feedback Vertex Set Problem 
    MULUK, KOMAL (2019-05)
    Feedback Vertex Set (FVS) problem is a well known NP-complete problem in computational complexity theory. This is a vertex deletion problem in which given a graph G=(V,E) and an integer k, we are asked to find a subset ...
  • 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