Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Max-flow min-cut theorem
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Theorem in optimization theory
Property
Value
dbo:
description
matematikai állítás
(hu)
mathematischer Satz
(de)
твердження в теорії оптимізації
(uk)
theorem in optimization theory
(en)
théorème de la théorie des graphes
(fr)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Max_flow.svg?width=300
dbo:
wikiPageWikiLink
dbc
:Combinatorial_optimization
dbr
:Glossary_of_graph_theory
dbc
:Theorems_in_graph_theory
dbr
:Maximum_flow_problem
dbr
:Menger's_theorem
dbr
:Linear_programming
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Directed_graph
dbr
:Flow_network
dbr
:L._R._Ford_Jr.
dbr
:Edmonds–Karp_algorithm
dbr
:Computer_science
dbr
:Vijay_Vazirani
dbc
:Network_flow_problem
dbr
:Ford–Fulkerson_algorithm
dbr
:Kenneth_Steiglitz
dbr
:Minimum_cut
dbr
:D._R._Fulkerson
dbr
:Approximate_max-flow_min-cut_theorem
dbr
:GNRS_conjecture
dbr
:Dual_problem
dbr
:Dual_linear_program
dbr
:Optimization_(mathematics)
dbr
:Linear_program
dbr
:Max-flow
dbr
:Maximum_flow
dbr
:Ford-Fulkerson_algorithm
dbr
:Christos_H._Papadimitriou
dbr
:Min-cut
dbr
:File:Image_segmentation.jpg
dbr
:File:Max-flow_min-cut_project-selection.svg
dbr
:File:Max_flow.svg
dbp:
wikiPageUsesTemplate
dbt
:Cite_book
dbt
:Reflist
dbt
:Math
dbt
:=
dbt
:See_also
dbt
:Mvar
dbt
:Short_description
dct:
subject
dbc
:Combinatorial_optimization
dbc
:Theorems_in_graph_theory
dbc
:Network_flow_problem
gold:
hypernym
dbr
:Case
rdfs:
label
Max-flow min-cut theorem
(en)
Teorema de flux màxim tall mínim
(ca)
Fordova–Fulkersonova věta
(cs)
Teoremo pri maksimuma-fluo kaj minimuma-tranĉo
(eo)
Max-Flow-Min-Cut-Theorem
(de)
Théorème flot-max/coupe-min
(fr)
最大フロー最小カット定理
(ja)
Teorema del flusso massimo e taglio minimo
(it)
Max-flow-min-cut-stelling
(nl)
Teorema do fluxo máximo e corte mínimo
(pt)
Max-flöde, minsta-snitt
(sv)
Теорема Форда — Фалкерсона
(ru)
Теорема Форда — Фалкерсона
(uk)
最大流最小割定理
(zh)
rdfs:
seeAlso
dbr
:Cederbaum's_maximum_flow_theorem
dbr
:Maximum_flow_problem
dbr
:Menger's_theorem
owl:
sameAs
yago-res
:Max-flow min-cut theorem
freebase
:Max-flow min-cut theorem
wikidata
:Max-flow min-cut theorem
dbpedia-it
:Max-flow min-cut theorem
dbpedia-nl
:Max-flow min-cut theorem
dbpedia-de
:Max-flow min-cut theorem
dbpedia-fr
:Max-flow min-cut theorem
dbpedia-zh
:Max-flow min-cut theorem
dbpedia-ja
:Max-flow min-cut theorem
dbpedia-pt
:Max-flow min-cut theorem
dbpedia-he
:Max-flow min-cut theorem
dbpedia-hu
:Max-flow min-cut theorem
dbpedia-fa
:Max-flow min-cut theorem
dbpedia-ru
:Max-flow min-cut theorem
dbpedia-sv
:Max-flow min-cut theorem
dbpedia-vi
:Max-flow min-cut theorem
dbpedia-ca
:Max-flow min-cut theorem
dbpedia-cs
:Max-flow min-cut theorem
dbpedia-eo
:Max-flow min-cut theorem
dbpedia-uk
:Max-flow min-cut theorem
dbpedia-global
:Max-flow min-cut theorem
dbr
:Max-flow min-cut theorem
prov:
wasDerivedFrom
wikipedia-en
:Max-flow_min-cut_theorem?oldid=1275390372&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Image_segmentation.jpg
wiki-commons
:Special:FilePath/Max-flow_min-cut_project-selection.svg
wiki-commons
:Special:FilePath/Max_flow.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Max-flow_min-cut_theorem
is
dbo:
knownFor
of
dbr
:George_Dantzig
is
dbo:
wikiPageRedirects
of
dbr
:Max-Flow_Min-Cut_theorem
dbr
:Max-flow,_mincut_theorem
dbr
:Max-flow-min-cut
dbr
:Max-flow_min-cut
dbr
:Max_flow_in_networks
dbr
:Max_flow_min_cut
dbr
:Max_flow_min_cut_theorem
dbr
:Maxflow-mincut
dbr
:Maximum_flow,_minimum_cut_theorem
dbr
:Maximum_flow/minimum_cut_theorem
dbr
:Maximum_flow_minimum_cut_theorem
dbr
:MFMC
dbr
:Min_cut_max_flow
dbr
:Minimal_cut
is
dbo:
wikiPageWikiLink
of
dbr
:Optical_flow
dbr
:Hall's_marriage_theorem
dbr
:Glossary_of_graph_theory
dbr
:Active_contour_model
dbr
:Cederbaum's_maximum_flow_theorem
dbr
:Maximum_flow_problem
dbr
:Menger's_theorem
dbr
:Unimodular_matrix
dbr
:Cut_(graph_theory)
dbr
:Linear_network_coding
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Connectivity_(graph_theory)
dbr
:Flow_network
dbr
:Pipe_network_analysis
dbr
:L._R._Ford_Jr.
dbr
:Gomory–Hu_tree
dbr
:Fulkerson_Prize
dbr
:Closure_problem
dbr
:George_Dantzig
dbr
:K-edge-connected_graph
dbr
:Ford–Fulkerson_algorithm
dbr
:Minimum_cut
dbr
:Push–relabel_maximum_flow_algorithm
dbr
:Skew-symmetric_graph
dbr
:Graph_cut_optimization
dbr
:Graph_cuts_in_computer_vision
dbr
:Karger's_algorithm
dbr
:Cooperative_diversity
dbr
:Iterative_compression
dbr
:Approximate_max-flow_min-cut_theorem
dbr
:Segmentation-based_object_categorization
dbr
:GNRS_conjecture
dbr
:Extended_natural_numbers
dbr
:Network_flow_problem
dbr
:Quadratic_pseudo-Boolean_optimization
dbr
:Dual_linear_program
dbr
:Max-Flow_Min-Cut_theorem
dbr
:Max-flow,_mincut_theorem
dbr
:Max-flow-min-cut
dbr
:Max-flow_min-cut
dbr
:Max_flow_in_networks
dbr
:Max_flow_min_cut
dbr
:Max_flow_min_cut_theorem
dbr
:Maxflow-mincut
dbr
:Maximum_flow,_minimum_cut_theorem
dbr
:Maximum_flow/minimum_cut_theorem
dbr
:Maximum_flow_minimum_cut_theorem
dbr
:MFMC
dbr
:Min_cut_max_flow
dbr
:Minimal_cut
is
dbp:
knownFor
of
dbr
:George_Dantzig
is
foaf:
primaryTopic
of
wikipedia-en
:Max-flow_min-cut_theorem
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International