# Search results for: Ramakrishna Thurimella

IEEE Transactions on Mobile Computing > 2017 > 16 > 9 > 2611 - 2624

IEEE Security & Privacy > 2017 > 15 > 1 > 12 - 20

*log*

^{2}n) time using O(m) processors. We present a new algorithm for finding all separation pairs of a biconnected...

Pervasive and Mobile Computing > 2016 > 32 > C > 78-92

*log*n) and the processor-time product is O((m + n)·α(m, n)) where α is the inverse Ackerman function; here n is the number of vertices, and m is the number of edges in the graph. The algorithm is optimal for m≥n

*log** n. Our algorithm, like other parallel algorithms...

Lecture Notes in Computer Science > STACS 89 > 205-217

Lecture Notes in Computer Science > Information and Communications Security > Network Security > 480-494

^{1}of a graph at an optimal cost. Since the general problem is

*NP*-hard, we focus on efficient approximation schemes that come within a constant factor from the optimal. Previous algorithms either do not take edge costs into consideration, or run slower than our algorithm. Our algorithm takes as input an undirected graph G

_{0}= (

*V*, E

_{0}) on

*n*vertices,...

Optimization Letters > 2011 > 5 > 3 > 479-490

Journal of Algorithms > 1999 > 33 > 1 > 15-50

^{2}n

^{2}+k

^{3}n

^{1.5})-time (deterministic)...

Journal of Algorithms > 1997 > 23 > 1 > 160-179