Browsing by Advisor "Hariharan, Ramesh"

Now showing items 1-3 of 3

    • Approximation algorithms for the K- MST problem 

      Singhal, Amar
      Given a graph GGG on nnn vertices, the kkk-MST optimization problem is to find a tree spanning at least kkk vertices of GGG such that the cost of the tree is minimized over all such possible trees. The main contribution ...

    • Bounds On Augmented Automata And Quantum Adiabatic Optimization 

      Rao, M V Panduranga (2009-05-25)
      Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ...

    • Some results about minimum cuts, treewidth and hamiltonian circuits 

      Chandran, L Sunil
      In this thesis, we study various graph theoretic structures. One of the topics we study is the minimum cuts in a graph. We relate the number of minimum cuts in a weighted undirected graph with various structural parameters ...