arrow
返回

Maximal Flow Through a Network

delete2018-11-20
delete0
delete
OA
AI
DOI:10.4153/cjm-1956-045-5delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Introduction. The problem discussed in this paper was formulated by T. Harris as follows:“Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other.”
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

暂无期刊信息

机构

暂无机构信息
引用论文

引用论文

暂无论文信息