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

A powerful, generic, and object-oriented C++ library for creating and manipulating directed and undirected graphs. Developed as a student project at Polytech Tours, this library emphasizes software ...

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

Key-value, document-oriented, column family, graph, relational… Today we seem to have as many kinds of databases as there are kinds of data. While this may make choosing a database harder, it makes ...