Detail publikace
Network Flows
ŠEDA, M.
Anglický název
Network Flows
Typ
Článek recenzovaný mimo WoS a Scopus
Jazyk
en
Originální abstrakt
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.
Klíčová slova anglicky
maximum flow problem, multicommodity flows
Vydáno
2007-11-01
ISSN
1451-107X
Časopis
Transport and Logistics
Ročník
2007
Číslo
special issue
Strany od–do
116–119
Počet stran
4
BIBTEX
@article{BUT44708,
author="Miloš {Šeda}",
title="Network Flows",
journal="Transport and Logistics",
year="2007",
volume="2007",
number="special issue",
pages="116--119",
issn="1451-107X"
}