S&P 500's concentration risk is prohibitively high, and that's on top of the extremely high valuations, record low dividend ...

A high-performance C# wrapper for the LEMON (Library for Efficient Modeling and Optimization in Networks) graph library, providing access to state-of-the-art maximum flow algorithms.

With fatal overdoses rising, federal conspiracy and distribution cases filed this year provide a window into the drugs and defendants involved in illegal trafficking in the community. Jail mugshots of ...

Abstract: In this talk, I will present a new combinatorial algorithm for maximum flow that is based on running the weighted push-relabel algorithm introduced in [BBST ...

* you may not use this file except in compliance with the License. * You may obtain a copy of the License at * http://www.apache.org/licenses/LICENSE-2.0 ...

ABSTRACT: Let G be a connected graph with vertex set V( G ) . Then the degree resistance distance of G is defined as D R ( G )= ∑ { u,v }⊆V( G ) ( d( u )+d( v ) )R( u,v ) , where d( u ) is the degree ...

Abstract: An Undirected Storage Time Aggregated Graph (US TAG) model is proposed for solving the maximum flow problem in Unmanned Surface Vessel (USV) networks. Considering the time-varying ...