Contracting Neighbor-Node-Set Approach for Solving Maximum Flow Problem in Directed Network

ZHAO Shu,XU Xian-Sheng,HUA Bo,ZHANG Yan-Ping

PDF(434 KB)
Pattern Recognition and Artificial Intelligence ›› 2013, Vol. 26 ›› Issue (5) : 425-431.
Orignal Article

Contracting Neighbor-Node-Set Approach for Solving Maximum Flow Problem in Directed Network

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. {{journal.qiKanMingCheng_EN}}. 2013, 26(5): 425-431

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(434 KB)

Accesses

Citation

Detail
Sections
Recommended
Copyright © Pattern Recognition and Artificial Intelligence
Address: No.350 Shushan Road, Library and Journals Center, Hefei Institutes of Physical Science, Chinese Academy of Sciences，Hefei, Anhui, P.R.China
Post Code:230031
Tel: 0551-65591176　　E-mail: bjb@iim.ac.cn
Powered by Beijing Magtech Co. Ltd.

/

〈 〉