Publication result detail

Network Flows

ŠEDA, M.

Original Title

Network Flows

English Title

Network Flows

Type

Peer-reviewed article not indexed in WoS or Scopus

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.

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

maximum flow problem, multicommodity flows

Key words in English

maximum flow problem, multicommodity flows

Authors

ŠEDA, M.

Released

01.11.2007

ISBN

1451-107X

Periodical

Transport and Logistics

Volume

2007

Number

special issue

State

Slovak Republic

Pages from

116

Pages to

119

Pages count

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