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:
Flow network
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Directed graph where each edge has a capacity and each edge receives a flow
Property
Value
dbo:
description
matematikai fogalom a gráfelméletben
(hu)
graf dirigit en què cada aresta està ponderada amb un flux i una capacitat
(ca)
класс ориентированных графов
(ru)
grafo dirigido y grafo ponderado
(es)
directed graph where each edge has a capacity and each edge receives a flow
(en)
gerichteter gewichteter Graph mit ausgezeichneter Quelle und Senke
(de)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Network_Flow_Cropped2_-_revised.png?width=300
dbo:
wikiPageExternalLink
https://web.archive.org/web/20180121140629/http:/quickgraph.codeplex.com/
http://www.dis.uniroma1.it/~challenge9/download.shtml
http://lemon.cs.elte.hu/
http://quickgraph.codeplex.com/
https://archive.org/details/graphalgorithms0000even
https://web.archive.org/web/20080111234829/http:/www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/maxflow/Maxflow.shtml
dbo:
wikiPageWikiLink
dbr
:James_B._Orlin
dbr
:Robert_Ulanowicz
dbr
:Kirchhoff's_current_law
dbr
:Ecology
dbr
:Function_(mathematics)
dbr
:Thermodynamics
dbr
:Oriented_matroid
dbr
:Graph_theory
dbr
:Ravindra_K._Ahuja
dbr
:Dinic's_algorithm
dbr
:Without_loss_of_generality
dbr
:Food_web
dbr
:Charles_E._Leiserson
dbr
:Edmonds–Karp_algorithm
dbr
:Information_theory
dbr
:Clifford_Stein
dbr
:Directed_graph
dbr
:Thomas_H._Cormen
dbr
:Ortrud_Oellermann
dbr
:Circulation_problem
dbr
:Shortest_path_problem
dbr
:Operations_research
dbr
:Centrality
dbr
:Ford–Fulkerson_algorithm
dbr
:Assignment_problem
dbr
:Max-flow_min-cut_theorem
dbr
:Thomas_L._Magnanti
dbr
:Braess's_paradox
dbr
:Maximum_flow_problem
dbr
:Cut_(graph_theory)
dbr
:Gain_graph
dbr
:Multi-commodity_flow_problem
dbc
:Network_flow_problem
dbr
:Nowhere-zero_flow
dbr
:Ronald_L._Rivest
dbr
:Transportation_problem
dbr
:Electrical_distribution
dbr
:Bipartite_matching
dbr
:Push–relabel_algorithm
dbr
:Gary_Theodore_Chartrand
dbr
:Flow_(computer_networking)
dbr
:Flow_graph_(disambiguation)
dbr
:Minimum_cost_flow_problem
dbr
:Oreilly_Media
dbr
:Max_flow
dbr
:Maximum_flow
dbr
:File:Network_Flow_SVG.svg
dbr
:File:Network_flow_residual_SVG.svg
dbp:
date
2018-01-21
(xsd:date)
dbp:
url
https://web.archive.org/web/20180121140629/http:/quickgraph.codeplex.com/
dbp:
wikiPageUsesTemplate
dbt
:Cite_book
dbt
:Mabs
dbt
:Mathbb
dbt
:=
dbt
:Citation_needed
dbt
:Commons
dbt
:Math
dbt
:Mset
dbt
:Mvar
dbt
:Reflist
dbt
:See_also
dbt
:Short_description
dbt
:Unreferenced_section
dbt
:Webarchive
dct:
subject
dbc
:Network_flow_problem
gold:
hypernym
dbr
:Graph
rdf:
type
owl
:Thing
owl
:Thing
rdfs:
label
Flow network
(en)
Tok v síti
(cs)
Xarxa de flux
(ca)
Flüsse und Schnitte in Netzwerken
(de)
Red de flujo
(es)
Réseau de flot
(fr)
Rete di flusso
(it)
네트워크 흐름
(ko)
フローネットワーク
(ja)
Rede de fluxo
(pt)
Sieć przepływowa
(pl)
Потокова мережа
(uk)
Транспортная сеть
(ru)
网络流
(zh)
rdfs:
seeAlso
dbr
:Pipe_network_analysis
owl:
sameAs
yago-res
:Flow network
dbpedia-commons
:Flow network
freebase
:Flow network
wikidata
:Flow network
dbpedia-de
:Flow network
dbpedia-es
:Flow network
dbpedia-it
:Flow network
dbpedia-pl
:Flow network
dbpedia-fr
:Flow network
dbpedia-da
:Flow network
dbpedia-he
:Flow network
dbpedia-hu
:Flow network
dbpedia-ja
:Flow network
dbpedia-pt
:Flow network
dbpedia-ru
:Flow network
dbpedia-zh
:Flow network
dbpedia-vi
:Flow network
dbpedia-ko
:Flow network
dbpedia-ca
:Flow network
dbpedia-cs
:Flow network
dbpedia-fa
:Flow network
dbpedia-hy
:Flow network
dbpedia-th
:Flow network
dbpedia-tl
:Flow network
dbpedia-uk
:Flow network
dbpedia-global
:Flow network
prov:
wasDerivedFrom
wikipedia-en
:Flow_network?oldid=1300952579&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Network_Flow_Cropped2_-_revised.png
wiki-commons
:Special:FilePath/Network_flow_residual_PNG.png
foaf:
isPrimaryTopicOf
wikipedia-en
:Flow_network
is
dbo:
knownFor
of
dbr
:Peter_Whittle_(mathematician)
is
dbo:
wikiPageDisambiguates
of
dbr
:Network
dbr
:Flow
is
dbo:
wikiPageRedirects
of
dbr
:Transportation_network_(graph_theory)
dbr
:Flow_(graph_theory)
dbr
:Network_flow_(function)
dbr
:Network_with_gains
dbr
:Transportation_network_(mathematics)
dbr
:Augmenting_path
dbr
:Flow_conservation
dbr
:Flow_function
dbr
:Flow_problem
dbr
:Random_networks
dbr
:Generalized_network
dbr
:Path_augmenting
dbr
:Residual_graph
dbr
:Residual_network
dbr
:Supersink
dbr
:Supersource
is
dbo:
wikiPageWikiLink
of
dbr
:Transportation_network_(graph_theory)
dbr
:Air_Transport_Network
dbr
:Supply_chain_engineering
dbr
:Linear_network_coding
dbr
:Robert_Ulanowicz
dbr
:Convention_for_the_Protection_of_Indiv...Automatic_Processing_of_Personal_Data
dbr
:Flow_(graph_theory)
dbr
:Electron
dbr
:R._Tyrrell_Rockafellar
dbr
:Inventory_theory
dbr
:Frank–Wolfe_algorithm
dbr
:Maximum_cardinality_matching
dbr
:Logistics
dbr
:Combinatorial_optimization
dbr
:Trace_(linear_algebra)
dbr
:Graph_theory
dbr
:Mathematical_optimization
dbr
:Network_theory
dbr
:Queueing_theory
dbr
:Aquifer_test
dbr
:Edward_B._Curtis
dbr
:Minimum_cut
dbr
:Dinic's_algorithm
dbr
:Network_medicine
dbr
:Network_science
dbr
:Bellman–Ford_algorithm
dbr
:Leon_Mirsky
dbr
:Mobile_IPTV
dbr
:Network
dbr
:Munish_Chander_Puri
dbr
:Open_energy_system_models
dbr
:Minimum-cost_flow_problem
dbr
:Linear_programming
dbr
:Edmonds–Karp_algorithm
dbr
:Kőnig's_theorem_(graph_theory)
dbr
:Conduit_(software)
dbr
:Directed_graph
dbr
:Endre_Boros
dbr
:Counter-IED_efforts
dbr
:OR-Tools
dbr
:Traffic_flow_(computer_networking)
dbr
:Circulation_problem
dbr
:Erdős–Gallai_theorem
dbr
:Matching_(graph_theory)
dbr
:Shortest_path_problem
dbr
:D._R._Fulkerson
dbr
:Flow
dbr
:Energy_system
dbr
:Schedule
dbr
:Upward_planar_drawing
dbr
:Flow_graph_(mathematics)
dbr
:Push–relabel_maximum_flow_algorithm
dbr
:Ford–Fulkerson_algorithm
dbr
:Transport_network_analysis
dbr
:Sink_(disambiguation)
dbr
:Max-flow_min-cut_theorem
dbr
:Breadth-first_search
dbr
:Biconnected_graph
dbr
:List_of_algorithms
dbr
:Internet_universality
dbr
:Connectivity_(graph_theory)
dbr
:K-edge-connected_graph
dbr
:L._R._Ford_Jr.
dbr
:Pseudoforest
dbr
:Thomas_L._Magnanti
dbr
:Maximum_flow_problem
dbr
:Discrete_tomography
dbr
:Graph_traversal
dbr
:Graph_cut_optimization
dbr
:Evacuation_simulation
dbr
:Peter_Whittle_(mathematician)
dbr
:Cut_(graph_theory)
dbr
:Edgar_Gilbert
dbr
:Gain_graph
dbr
:Multi-commodity_flow_problem
dbr
:Graph_cuts_in_computer_vision
dbr
:Nowhere-zero_flow
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Out-of-kilter_algorithm
dbr
:Sink_(computing)
dbr
:Approximate_max-flow_min-cut_theorem
dbr
:Energy_informatics
dbr
:Flow_graph
dbr
:Network_flow_problem
dbr
:Market_equilibrium_computation
dbr
:Integrated_nanoliter_system
dbr
:Numbers_(season_3)
dbr
:Network_flow_(function)
dbr
:Network_with_gains
dbr
:Transportation_network_(mathematics)
dbr
:Conductance_(graph)
dbr
:Augmenting_path
dbr
:Flow_conservation
dbr
:Flow_function
dbr
:Flow_problem
dbr
:Random_networks
dbr
:Generalized_network
dbr
:Path_augmenting
dbr
:Residual_graph
dbr
:Residual_network
dbr
:Supersink
dbr
:Supersource
is
rdfs:
seeAlso
of
dbr
:Oriented_matroid
is
foaf:
primaryTopic
of
wikipedia-en
:Flow_network
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International