Semantic Scholar uses AI to extract papers important to this topic.
This paper proposes a maximum-flow-based complex network approach for the analysis of the vulnerability of power systems. A new… Expand Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy… Expand Abstract.We review two papers that are of historical interest for combinatorial optimization: an article of A.N. Tolsto&ıbreve… Expand It was conjectured by Fulkerson that the edge-set of any bridgeless graph can be covered by six cycles (union of circuits) such… Expand The polytopal approach of Edmonds and Fulkerson has been used with great success in the development of polynomial algorithms for… Expand Often the optimum of a combinatorial optimization problem is characterized by a min-max relation, asserting that the maximum… Expand A class of characteristic function games arising from maximum flow problems is introduced and is shown to coincide with the class… Expand Abstract The max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded as a statement about the… Expand Abstract : The paper is concerned with an integer programming characterization of a cut in a network. This characterization… Expand In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network… Expand