发布求助
文献互助 智能选刊 最新文献

Network Flow Algorithms最新文献

筛选
英文 中文
Multicommodity Flow Algorithms 多商品流算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.009
{"title":"Multicommodity Flow Algorithms","authors":"","doi":"10.1017/9781316888568.009","DOIUrl":"https://doi.org/10.1017/9781316888568.009","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123845816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Index 指数
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.013
{"title":"Index","authors":"","doi":"10.1017/9781316888568.013","DOIUrl":"https://doi.org/10.1017/9781316888568.013","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124126376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Global Minimum Cut Algorithms 全局最小割算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.005
{"title":"Global Minimum Cut Algorithms","authors":"","doi":"10.1017/9781316888568.005","DOIUrl":"https://doi.org/10.1017/9781316888568.005","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116085830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
More Maximum Flow Algorithms 更多最大流量算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.006
{"title":"More Maximum Flow Algorithms","authors":"","doi":"10.1017/9781316888568.006","DOIUrl":"https://doi.org/10.1017/9781316888568.006","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121934397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalized Flow Algorithms 广义流算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.008
{"title":"Generalized Flow Algorithms","authors":"","doi":"10.1017/9781316888568.008","DOIUrl":"https://doi.org/10.1017/9781316888568.008","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124783662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Electrical Flow Algorithms 电流算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.010
{"title":"Electrical Flow Algorithms","authors":"","doi":"10.1017/9781316888568.010","DOIUrl":"https://doi.org/10.1017/9781316888568.010","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126454859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Preliminaries: Shortest Path Algorithms 入门:最短路径算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.003
{"title":"Preliminaries: Shortest Path Algorithms","authors":"","doi":"10.1017/9781316888568.003","DOIUrl":"https://doi.org/10.1017/9781316888568.003","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131083325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimum-Cost Circulation Algorithms 最小成本循环算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.007
{"title":"Minimum-Cost Circulation Algorithms","authors":"","doi":"10.1017/9781316888568.007","DOIUrl":"https://doi.org/10.1017/9781316888568.007","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134579884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximum Flow Algorithms 最大流量算法
Network Flow Algorithms Pub Date : 2019-09-05 DOI: 10.1017/9781316888568.004
Goldberg, Rao
{"title":"Maximum Flow Algorithms","authors":"Goldberg, Rao","doi":"10.1017/9781316888568.004","DOIUrl":"https://doi.org/10.1017/9781316888568.004","url":null,"abstract":"","PeriodicalId":372544,"journal":{"name":"Network Flow Algorithms","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132182536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信