| 000 | 00733nam a22002297a 4500 | ||
|---|---|---|---|
| 003 | NISER | ||
| 005 | 20260325155501.0 | ||
| 008 | 260325b |||||||| |||| 00| 0 hin d | ||
| 040 |
_aNISER LIBRARY _beng _cNISER LIBRARY |
||
| 082 | 0 | 4 |
_a519.173 _bABH-R |
| 100 | 1 | _aAbhinav, Ankit | |
| 245 | 1 | 0 |
_aRevisiting deletion problems : _ba parameterized exploration with connectivity constraints |
| 260 |
_aBhubaneswar : _bNISER, _c2026. |
||
| 300 |
_axi, 152 pages ; _c29.5 cm. |
||
| 650 | 0 | _aGraph theory | |
| 650 | 0 | _aAlgorithms | |
| 650 | 0 | _aConnectivity (Graph theory) | |
| 650 | 0 | _aParameterized complexity | |
| 700 | 1 |
_aBanik, Aritra _eGuide |
|
| 856 | 4 | 1 | _uhttps://idr.niser.ac.in/jspui/handle/123456789/1503 |
| 942 |
_2udc _cTHPHD |
||
| 999 |
_c36855 _d36855 |
||