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

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

PrefixNamespace IRI
n7http://en.wikipedia.org/wiki/Category:
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
clgohttp://caligraph.org/ontology/
n4http://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/
n9http://en.wikipedia.org/wiki/Hall'
clgrhttp://caligraph.org/resource/
Subject Item
clgr:George_Dantzig
clgo:knownFor
clgr:Max-flow_min-cut_theorem
Subject Item
clgr:Max-flow_min-cut_theorem
rdf:type
clgo:Graph_theory_topic owl:NamedIndividual clgo:Network_theory_topic clgo:Theorem_in_graph_theory
rdfs:label
Max-flow min-cut theorem
owl:sameAs
dbr:Max-flow_min-cut_theorem
prov:wasDerivedFrom
n4:List_of_network_theory_topics n7:Theorems_in_graph_theory n9:s_marriage_theorem n4:List_of_graph_theory_topics n4:List_of_theorems
skos:prefLabel
Max-flow min-cut theorem
skos:altLabel
max-flow min-cut theorem Max-flow min-cut theorem of networks s–t cut maximum-flow minimum-cut theorem proof here Max-flow min-cut theorem#Linear program formulation linear program maximum flow Max flow min cut theorem max-flow min-cut MINCUT max-flow algorithm Max-flow Min-cut theorem max-flow/min-cut