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, ...

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 ...

A new framework called Falcon, developed by Unnikrishnan Cheramangalath, is revolutionizing graph analytics. This ...

"I really tried to imagine, if I attended this conference two years ago, what kind of twenty minute talk would have been most valuable," said Joshua Shinavier, a research scientist at ride-sharing ...