SRNKSora Roxas Namine Kairi
Copyright 1988-2018, All rights reserved.
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]).