This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Maximum_flow_problem
dbo:wikiPageWikiLink
dbr:Circulation_problem
Subject Item
dbr:Fulkerson_Prize
dbo:wikiPageWikiLink
dbr:Circulation_problem
Subject Item
dbr:Circulation
dbo:wikiPageWikiLink
dbr:Circulation_problem
dbo:wikiPageDisambiguates
dbr:Circulation_problem
Subject Item
dbr:Minimum-cost_flow_problem
dbo:wikiPageWikiLink
dbr:Circulation_problem
Subject Item
dbr:Flow_network
dbo:wikiPageWikiLink
dbr:Circulation_problem
Subject Item
dbr:Circulation_problem
rdf:type
yago:Condition113920835 yago:Problem114410605 yago:WikicatMathematicalProblems yago:Difficulty114408086 yago:State100024720 yago:Abstraction100002137 yago:Attribute100024264
rdfs:label
Circulation problem
rdfs:comment
The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special nodes). In variants of the problem, there are multiple commodities flowing through the network, and a cost on the flow.
dcterms:subject
dbc:Mathematical_problems dbc:Network_flow_problem
dbo:wikiPageID
6808344
dbo:wikiPageRevisionID
1058644987
dbo:wikiPageWikiLink
dbr:Flow_network dbr:NP-complete dbc:Network_flow_problem dbc:Mathematical_problems dbr:Linear_programming dbr:Shortest_path_problem dbr:Polynomial_time dbr:Maximum_flow_problem dbr:Edmonds–Karp_algorithm dbr:Minimum_cost_flow_problem dbr:Minimum_cost_maximum_flow_problem dbr:Minimum_cost_multi-commodity_flow_problem dbr:Multi-commodity_flow_problem
owl:sameAs
n11:4iBf6 freebase:m.0gpykx yago-res:Circulation_problem wikidata:Q5121696
dbo:abstract
The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special nodes). In variants of the problem, there are multiple commodities flowing through the network, and a cost on the flow.
gold:hypernym
dbr:Generalisation
prov:wasDerivedFrom
wikipedia-en:Circulation_problem?oldid=1058644987&ns=0
dbo:wikiPageLength
4577
foaf:isPrimaryTopicOf
wikipedia-en:Circulation_problem
Subject Item
dbr:Multi-commodity_flow_problem
dbo:wikiPageWikiLink
dbr:Circulation_problem
Subject Item
dbr:Minimum_cost_circulation_problem
dbo:wikiPageWikiLink
dbr:Circulation_problem
dbo:wikiPageRedirects
dbr:Circulation_problem
Subject Item
dbr:Network_circulation
dbo:wikiPageWikiLink
dbr:Circulation_problem
dbo:wikiPageRedirects
dbr:Circulation_problem
Subject Item
wikipedia-en:Circulation_problem
foaf:primaryTopic
dbr:Circulation_problem