SRNKSora Roxas Namine Kairi
References in periodicals archive ?
Given as input (G, s, t, N), where G is an undirected graph of size n, s, t are vertices in G and N is a k-rich neighborhood matrix of G, the algorithm SRNK runs in space O(log(n)) and computes a graph G' such that
[1992] algorithm, [G.sub.i] is computed as SRNK ([G.sub.i-1]], s, t, [N.sub.i-1]).
Tenders are invited for strengthening the english language laboratory to srnk govt.
Limited Tenders are invited for 1)Slv Ht Srnk Vg95343t05d005a Qty: 25 Mr 2)Slv Ht Srnk M23053/5-102-9 Qty: 50 Mr 8)Null Qty: Null Null