Browsing by Advisor "Veni Madhavan, C E"
Now showing items 1-5 of 5
-
Algorithmic studies on graph domination -refinements and extensions
Given a graph G = (V, E), where V is a finite set of vertices and E is the set of edges, a set D ? V of vertices is a dominating set if every vertex in V ? D is adjacent to some vertex in D. The size of a minimum cardinality ... -
Algorithms and lower bounds for graph connectivity and covering
Graph Connectivity is a well-studied problem, and its time complexity is well understood. However, its space complexity remains a mystery. Closely related to the space complexity of connectivity is the problem of derandomizing ... -
Fast primality testing algorithm study and implementation
In the previous chapters we discussed the details of some primality testing algorithms and the implementation of a fast deterministic primality testing algorithm. Our implementation consists of programs written in Pascal ... -
New charactrisations and algorithmic studies on chordal graphs and k-trees
A wealth of literature on graph theory has appeared in the last few centuries. This is to a large extent due to the increase in the applications of graph theory to problems of practical interest. Graph theory is also closely ... -
Weak visibility and related problems on simple polygons
Visibility and shortest path problems are two important areas of research in computational geometry. In this thesis we study weak visibility and related problems on simple polygons and propose efficient algorithms. We study ...