miun.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Comparative Study of the Labelling Algorithms for Solving the Problem of Maximum Flow in Networks
1978 (English)In: Proceedings of Informatica 78: Vol. 3, Bled, Slovenia, 1978, 120-121 p.Conference paper, (Other academic)
Abstract [en]

In this paper, the analysis of three labeling algorithms for finding the maximum flow in networks is presented. For each algorithm, a computer program is written and tested on networks. The comparison is made on the basis of the processing time and memory storage required for the implementation of each program. As a result, the relationship between the processing time required for each algorithm and the complexity of the networks is established.

Place, publisher, year, edition, pages
Bled, Slovenia, 1978. 120-121 p.
Keyword [en]
Algorithm, maximum flow problem, optimization
National Category
Computer Science
Identifiers
URN: urn:nbn:se:miun:diva-1944Local ID: 1656OAI: oai:DiVA.org:miun-1944DiVA: diva2:26976
Available from: 2008-09-30 Created: 2008-09-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Popova, Iskra
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 14 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf