CSpace
Some network enlargement problems
Yang, XG
1996-10-01
Source PublicationCHINESE SCIENCE BULLETIN
ISSN1001-6538
Volume41Issue:20Pages:1676-1678
Keywordnetwork enlargement minimum cost flow NP-hard combinatorial strongly polynomial algorithm
Language英语
WOS Research AreaScience & Technology - Other Topics
WOS SubjectMultidisciplinary Sciences
WOS IDWOS:A1996VV81600002
PublisherSCIENCE CHINA PRESS
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/28881
Collection中国科学院数学与系统科学研究院
AffiliationCHINESE ACAD SCI,INST SYST SCI,BEIJING 100080,PEOPLES R CHINA
Recommended Citation
GB/T 7714
Yang, XG. Some network enlargement problems[J]. CHINESE SCIENCE BULLETIN,1996,41(20):1676-1678.
APA Yang, XG.(1996).Some network enlargement problems.CHINESE SCIENCE BULLETIN,41(20),1676-1678.
MLA Yang, XG."Some network enlargement problems".CHINESE SCIENCE BULLETIN 41.20(1996):1676-1678.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yang, XG]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang, XG]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang, XG]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.