Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

Abstract: Traffic flow prediction, as one of the problems of spatial correlation analysis of time series, has been extensively studied. The extraction and fusion of effective spatio-temporal features ...

connect_knn_graph on host to correctly handle custom comparator (reduction_op). Currently cross component distance computation is hardcoded to pairwise distances, but the distance type may be mutual ...

Advances in Applied Probability, Vol. 24, No. 4 (Dec., 1992), pp. 845-857 (13 pages) A three-parameter model of a random directed graph (digraph) is specified by the ...