Prajakta Nimbhorkar
(The Institute of Mathematical Sciences, 2011)
The focus of this thesis is on the complexity analysis of some computational problems in restricted graph-classes. The problems considered include graph isomorphism, various path problems like reachability, shortest path, ...