Also found in: Dictionary.
Copyright 1988-2018 AcronymFinder.com, All rights reserved.
References in periodicals archive ?
We take (15) and (16) into (14) to obtain that the running time of EXTD in the worst case is at most O((4/9)[(n - m).sup.2]([(m + p).sup.p]/(p - 1)!)).
Given an undirected graph G = (V, E, w, c) with n nodes and m servers, EXTD runs in O([m.sup.p](p x [max.sub.1 [less than or equal to] i [less than or equal to] m] h2 + (8/3)n)) time for (p, m)-CSOP CLP on G and runs in at most 0((4/9)[(n - m).sup.2]((m + p)p/(p - 1)!)) time in the worst case.
In this subsection, we make a large number of numerical experiments to compare the running times of our algorithm GLOB and EXTD, respectively.
All the running times of EXTD for 10626 CAS's are depicted in Figure 5(a).