About: dbpedia:Flow_network   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : platform.yourdatastories.eu:8890 associated with source document(s)

In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in operations research, a directed graph is called a network. The vertices are called nodes and the edges are called arcs.

AttributesValues
rdfs:comment
  • In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in operations research, a directed graph is called a network. The vertices are called nodes and the edges are called arcs.
rdfs:seeAlso
foaf:depiction
  • External Image
thumbnail
is rdfs:seeAlso of
is field of
is known for of
Faceted Search & Find service v1.13.91 as of Nov 14 2017


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software