| 000 | 01365nam a2200229Ia 4500 | ||
|---|---|---|---|
| 008 | 160627s2011||||xx |||||||||||||| ||und|| | ||
| 100 |
_aGeevarghese Philip _eauthor |
||
| 245 | 4 | _aThe Kernelization complexity of some domination and covering problems | |
| 260 | _c2011 | ||
| 300 | _a160p. | ||
| 502 | _a2011 | ||
| 502 | _bPh.D | ||
| 502 | _cHBNI | ||
| 520 | 3 | _aPolynomial-time preprocessing is a simple algorithmic strategy which has been widely employed in practice to tackle hard problems. The quantification analysis of the efficiency of preprocessing algorithms are, in a certain precise sense, outside the pale of classical complexity theory. The notion of kernelization from parameterized complexity theory provides a framework for the mathematical analysis of polynomial-time preprocessing algorithms. Both kernelization and the closely related notion of fixed-parameter tractable (FPT) algorithms are very active areas of current research. In this thesis we describe the results of our study of the kernelization complexity of some graph domination and covering problems. | |
| 650 | 1 | 4 | _aComputer Science |
| 653 | 1 | 0 | _aHBNI Th 44 |
| 653 | 1 | 0 | _aKernelization Complexity |
| 720 | 1 |
_aVenkatesh Raman _eThesis advisor [ths] |
|
| 856 | _uhttp://www.imsc.res.in/xmlui/handle/123456789/274 | ||
| 942 |
_2THESIS135 _cTHESIS |
||
| 999 |
_c48840 _d48840 |
||