Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2585642> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Q2585642 subject Q7016099.
- Q2585642 subject Q7132787.
- Q2585642 abstract "In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max-flow min-cut theorem.".
- Q2585642 thumbnail Max_flow.svg?width=300.
- Q2585642 wikiPageExternalLink 0020-0190(78)90016-9.
- Q2585642 wikiPageExternalLink Max_flows_in_O(nm)_time.html.
- Q2585642 wikiPageExternalLink dynamic-trees.pdf.
- Q2585642 wikiPageWikiLink Q1065144.
- Q2585642 wikiPageWikiLink Q1184009.
- Q2585642 wikiPageWikiLink Q1195339.
- Q2585642 wikiPageWikiLink Q1244890.
- Q2585642 wikiPageWikiLink Q1302658.
- Q2585642 wikiPageWikiLink Q1412924.
- Q2585642 wikiPageWikiLink Q141495.
- Q2585642 wikiPageWikiLink Q1415372.
- Q2585642 wikiPageWikiLink Q15995100.
- Q2585642 wikiPageWikiLink Q1626444.
- Q2585642 wikiPageWikiLink Q166507.
- Q2585642 wikiPageWikiLink Q174733.
- Q2585642 wikiPageWikiLink Q1820973.
- Q2585642 wikiPageWikiLink Q202843.
- Q2585642 wikiPageWikiLink Q284695.
- Q2585642 wikiPageWikiLink Q2897180.
- Q2585642 wikiPageWikiLink Q325904.
- Q2585642 wikiPageWikiLink Q5121696.
- Q2585642 wikiPageWikiLink Q5135529.
- Q2585642 wikiPageWikiLink Q5218783.
- Q2585642 wikiPageWikiLink Q5369.
- Q2585642 wikiPageWikiLink Q583889.
- Q2585642 wikiPageWikiLink Q608294.
- Q2585642 wikiPageWikiLink Q6554218.
- Q2585642 wikiPageWikiLink Q7016099.
- Q2585642 wikiPageWikiLink Q7132787.
- Q2585642 wikiPageWikiLink Q730933.
- Q2585642 wikiPageWikiLink Q7693271.
- Q2585642 wikiPageWikiLink Q897769.
- Q2585642 wikiPageWikiLink Q90313.
- Q2585642 wikiPageWikiLink Q92638.
- Q2585642 comment "In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. The maximum value of an s-t flow (i.e., flow from source s to sink t) is equal to the minimum capacity of an s-t cut (i.e., cut severing s from t) in the network, as stated in the max-flow min-cut theorem.".
- Q2585642 label "Maximum flow problem".
- Q2585642 depiction Max_flow.svg.
