Results 1  10
of
94,644
A Short Proof Of Seymour's Characterization Of The Matroids With The MaxFlow MinCut Property
"... Seymour proved that the set of odd circuits of a signed binary matroid (M;) has the MaxFlow MinCut property if and only if it does not contain a minor isomorphic to (M(K4);E(K4)). ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Seymour proved that the set of odd circuits of a signed binary matroid (M;) has the MaxFlow MinCut property if and only if it does not contain a minor isomorphic to (M(K4);E(K4)).
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1311 (54 self)
 Add to MetaCart
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time
The maxflow mincut theorem for countable networks
 J. Combin. Theory (Series B
"... Abstract. We prove a strong version of the the MaxFlow MinCut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal ” to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does not co ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We prove a strong version of the the MaxFlow MinCut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal ” to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does
EHRHART CLUTTERS: REGULARITY AND MAXFLOW MINCUT
, 2010
"... If C is a clutter with n vertices and q edges whose clutter matrix has column vectors A = {v1,...,vq}, we call C an Ehrhart clutter if {(v1,1),...,(vq,1)} ⊂ {0,1} n+1 is a Hilbert basis. Letting A(P) be the Ehrhart ring of P = conv(A), we are able to show that if C is a uniform unmixed MFMC clutter ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
, then C has the MFMC property. We prove this conjecture for Meyniel graphs by showing that the clique clutters of Meyniel graphs are Ehrhart clutters. In much the same spirit, we provide a simple proof of our conjecture when C is a uniform clique clutter of a perfect graph. We close with a generalization
A New Mincut Maxflow Ratio for Multicommodity Flows
, 2002
"... We present an improved bound on the mincut maxflow ratio for multicommodity ow problems with specified demands. To obtain the numerator of this ratio, capacity of a cut is scaled by the demand that has to cross the cut. In the denominator, the maximum concurrent flow value is used. Our new bound i ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We present an improved bound on the mincut maxflow ratio for multicommodity ow problems with specified demands. To obtain the numerator of this ratio, capacity of a cut is scaled by the demand that has to cross the cut. In the denominator, the maximum concurrent flow value is used. Our new bound
On the MaxFlow MinCut Ratio for Directed Multicommodity Flows
 Theor. Comput. Sci
, 2003
"... We give a pure combinatorial problem whose solution determines maxflow mincut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of Greedy algorithm for maximum edge disjoint path problem. More precisely, our u ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We give a pure combinatorial problem whose solution determines maxflow mincut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of Greedy algorithm for maximum edge disjoint path problem. More precisely, our
1MaxFlow MinCut Theorems for MultiUser Communication Networks
"... Traditionally, communication networks are modeled and analyzed in terms of information flows in graphs. In this paper, we introduce a novel symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms from logic. In order to account ..."
Abstract
 Add to MetaCart
problems in this setup. For a large class of measures containing the dispersion, we first show that the maximum flow of information transmitted to the users is asymptotically equal to the mincut of the term set, which represents the number of degrees of freedom of that term set. On the other hand
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1961 (24 self)
 Add to MetaCart
coding rate region. Our result can be regarded as the Maxflow Mincut Theorem for network information flow. Contrary to one’s intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather
Note on a MaxFlowMinCut Property for Oriented Matroids
, 2007
"... We introduce a new maxflowmincut (MFMC) property for oriented matroids and give necessary and sufficient conditions for a flow lattice of an oriented matroid or more general for an integer lattice to have this property. ..."
Abstract
 Add to MetaCart
We introduce a new maxflowmincut (MFMC) property for oriented matroids and give necessary and sufficient conditions for a flow lattice of an oriented matroid or more general for an integer lattice to have this property.
A Volumetric Method for Building Complex Models from Range Images
, 1996
"... A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, and robus ..."
Abstract

Cited by 1018 (18 self)
 Add to MetaCart
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction
Results 1  10
of
94,644