Publication detail
Network Flows
ŠEDA, M.
Czech title
Toky v sítích
English title
Network Flows
Type
journal article - other
Language
en
Original abstract
Network flow problems are among the most important ones in graph theory. Many other graph theory problems, such as the shortest path problem, minimum spanning tree problem, and Steiner tree problem, may be formulated with the help of network flow tools. The flow problems have many specific formulations depending on the constraints imposed resulting in various applications in transportation, distribution, telecommunications, etc. Examples of flow networks can be found, for example, in electrical circuits, pipe networks, and city plans.
Czech abstract
Toky v sítích patří nejvýznamnější problémy teorie grafů. Mnoho problémů, jak jsou hledání nejkratší cesty, minimální kostra grafu nebo Steinerův problém, lze formulovat pomocí pojmů toků v sítích. Problémy toků mají mnoho specifických formulací, které závisí na daných omezeních a vedou na řadu aplikací v dopravě distribuci, telekomunikacích apod. Příklady toků v sítích lze najít např. v elektrických obvodech, potrubních sítích nebo plánech městských aglomerací.
English abstract
Network flow problems are among the most important ones in graph theory. Many other graph theory problems, such as the shortest path problem, minimum spanning tree problem, and Steiner tree problem, may be formulated with the help of network flow tools. The flow problems have many specific formulations depending on the constraints imposed resulting in various applications in transportation, distribution, telecommunications, etc. Examples of flow networks can be found, for example, in electrical circuits, pipe networks, and city plans.
Keywords in Czech
maximální tok v síti, víceproduktové toky
Keywords in English
maximum flow problem, multicommodity flows
RIV year
2007
Released
01.11.2007
ISSN
1451-107X
Journal
Transport and Logistics
Volume
2007
Number
special issue
Pages from–to
116–119
Pages count
4
BIBTEX
@article{BUT44708,
author="Miloš {Šeda},
title="Network Flows",
journal="Transport and Logistics",
year="2007",
volume="2007",
number="special issue",
month="November",
pages="116--119",
issn="1451-107X"
}