- もっと例文: 1 2 3 4 5 6 7
- Approximate max-flow min-cut theorems are mathematical propositions in network flow theory.
- The torrent of information could make today's network flow seem like a slow trickle.
- The names are justified by analogy to the more commonly studied network flow problems.
- Efforts to secure networks should not stifle innovation by fragmenting network flows of information.
- Thus, such network flow problems with bounded integer capacities have an integral optimal value.