Rangan C. Pandu

C. Pandu Rangan

Information about the author C. Pandu Rangan will soon be added to the site.
Found 3 papers in total
Algorithmic aspects of clique-transversal and clique-independent sets
Algorithmic aspects of clique-transversal and clique-independent sets
2000
A minimum clique-transversal set MCT(G) of a graph G = (V,E) is a set S⊆V of...
Generalized vertex covering in interval graphs
Generalized vertex covering in interval graphs
1992
Given an integer i and an undirected graph G , the generalized i -vertex cover problem...
An efficient algorithm for finding a two-pair, and its applications
An efficient algorithm for finding a two-pair, and its applications
1991
One of the fundamental notions in computer geometry is the concept of visibility. A...
Papers per page: