... q. Then we sort the survived vertices in descending order by their weights and store them in S (Lines 4–5). We load the query q and the vertices ranked above q into Q (Lines 7–10). If the k-core Ck (Q) of Q contains q, then we return ...
... vertices , P = { P1 , P2 , ............... ..Pn } , denoting processors and a set of edges L = { ( Pi , Pj ) | Pi , Pj ← P } denoting links between processors . Each processor ( vertex ) p has two weights , processing weight s , and memory ...
... vertex is taken out of Q. Since every vertex in Q has at least one uniquely labelled edge, we can now propagate the available labels to all other connected edges according to the vertex type. To arrange the order of processing, we need ...
... (Q) + 6 if Q = Q", y(Q) = ( y(Q) – 6 if Q = Q', y(Q) Otherwise, where 6 = min ... vertex in V, for any r < i. Without loss of generality, we may assume h = j ... weight w is integral, then the lexicographically largest packing ye {ye R ...
... Vertex weights are then assigned according to the vertex arrow ... q. It is to be noted, however, that the vertex weights (4.2) are real for q > 4 and complex for q × 4. B. Percolation (q = 1 limit) The percolation process ... process there is ...
... Q are then processed (see Lines 19–24). For an element u ∈ Q, all the outgoing edges u → v are considered and if spd[v] + weight ... processed (see Lines 25–39). The vertex v with minimum distance value is deleted from pqueue. Then all the ...
... vertex s in a weighted digraph D = ( V , A , c ) to the rest of the vertices , provided that all the weights of arcs ... Q. Moreover , a parameter d , is assigned to every vertex v Є V. Initially all vertices are in Q. In the process of the ...
... Q : = 0 2 foreach e E E do k ( e ) : = 0 3 foreach v EV do if l ( v ) ET ... vertex v in this process , this vertex is added to the set Q. In each step , a vertex with minimal weight ... vertices of e have been processed . The algorithm then ...
... processed by the same machine is chosen as Qc Q ) . Having removed all edges from the graph G , except the edges of the set V , we obtain the relaxation problem of finding a schedule that is feasible with respect to a graph ( Q , U1 , V ...
... vertex of г and the notation p →→ q instead of ( 1 , p ) →→→→ ( 1 , q ) for denoting a path in г. Remember that , because of Theorem 2.2 , we are interested in checking if there is a cycle of zero weight in the RDG G. We introduce ...