network flowsの例文

例文

もっと例文:   1  2  3  4  5  6  7


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