Detail publikačního výsledku

Network Flows

ŠEDA, M.

Originální název

Network Flows

Anglický název

Network Flows

Druh

Článek recenzovaný mimo WoS a Scopus

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.

Anglický 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

maximum flow problem, multicommodity flows

Klíčová slova v angličtině

maximum flow problem, multicommodity flows

Autoři

ŠEDA, M.

Vydáno

01.11.2007

ISSN

1451-107X

Periodikum

Transport and Logistics

Svazek

2007

Číslo

special issue

Stát

Slovenská republika

Strany od

116

Strany do

119

Strany počet

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"
}