Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
In this paper we propose a novel approach to represent coalitional games, called a Coalition-Flow Network (CF-NET), that builds upon a generalization of the network flow literature...
Talal Rahwan, Tomasz P. Michalak, Madalina Croitor...
As the network technology has been developed, the Next Generation Internet (NGI) such as Internet2, KOREN, KREONET2 and etc has been deployed to support bandwidth of Giga bps. And,...
For a lumped parameter model of a flow network driven by a periodic generator, we apply averaging to find an approximate solution and analyze its stability. The approximate soluti...
—Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through “stepping stone” hosts. Most ...
W. Timothy Strayer, Christine E. Jones, Beverly Sc...