A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
Guantao Chen, Michael Ferrara, Ronald J. Gould, Jo...
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
Paul Hines, Seth Blumsack, E. Cotilla Sanchez, C. ...
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intellige...