【摘要】 在经典的网络流理论的基础上,给出了超图的最大流和多终端最大流的有效算法。首次提出了表征超连通性的两个基本定理,给出了确定超图连通度的有效算法。文中算法及应用实例均编程上机试算,结果是令人满意的。文章最后提出了一些可供继续研究的相关课题。更多还原

【Abstract】 By applying network flow theories, the efficient algorithms for maximum flow and mul-titerminal flow in a hypergraph are presented. Furthermore, the two basic theorems expressing the connectivity of a hypergraph are proposed for first time and the algorithms for the determination of hypergraph connectivity are also presented. Finally, Some open questions are stated.更多还原