# Max-flow min-cut theorem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- IEEE INFOCOM - IEEE Conference on Computer…
- 2013

Fault-tolerance is one of the most important factors in designing networks. Failures in networks are sometimes caused by an event… (More)

Is this relevant?

2011

2011

- Proceedings International Conference on…
- 2011

Traffic congestion has severely affected the city's development, therefore, the research on method of traffic network bottleneck… (More)

Is this relevant?

2011

2011

- J. Comb. Theory, Ser. B
- 2011

We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there… (More)

Is this relevant?

2011

2011

- IEEE International Symposium on Information…
- 2011

A symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms… (More)

Is this relevant?

2008

2008

- 2008

We show how ’test’ vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian… (More)

Is this relevant?

2008

2008

- ArXiv
- 2008

Intrigued by the capacity of random networks, we start by pro ving a max-flow min-cut theorem that is applicable to any random… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Trans. Pattern Anal. Mach. Intell.
- 2004

After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- IEEE Trans. Information Theory
- 2000

We introduce a new class of problems callednetwork information flow which is inspired by computer network applications. Consider… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- J. ACM
- 1999

In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. In… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- SIAM J. Comput.
- 1998

It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow… (More)

Is this relevant?