REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

  1. Repozytorium Uniwersytetu w Białymstoku
  2. Czasopisma naukowe / Journals
  3. Formalized Mathematics
  4. Formalized Mathematics, 2005, Volume 13, Issue 2

Szukanie zaawansowane
  • Zespoły i Kolekcje


  • Zaloguj się
  • Zarejestruj się
  • Mój RUB
  • FAQ
  • Polityka
  • Regulamin
  • DOI
  • Instrukcja
  • Aspekty prawne
  • Open Access
  • Archiwum


  • Kontakt
  • O Dspace
  • Strona Biblioteki
  • Strona Uczelni



    • Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/21477
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorLee, Gilbert-
    dc.date.accessioned2026-11-09T13:04:47Z-
    dc.date.available2026-11-09T13:04:47Z-
    dc.date.issued2005-
    dc.identifier.citationFormalized Mathematics, Volume 13, Issue 2, Pages 305-314pl
    dc.identifier.issn1426-2630-
    dc.identifier.urihttp://hdl.handle.net/11320/21477-
    dc.description.abstractWe define and prove correctness of Ford-Fulkerson’s maximum network flow algorithm at the level of graph manipulations.pl
    dc.language.isoenpl
    dc.publisherUniversity of Białystokpl
    dc.rightsCC BY-SA 4.0-
    dc.rights.urihttps://creativecommons.org/licenses/by-sa/4.0/-
    dc.titleCorrectnesss of Ford-Fulkerson’s Maximum Flow Algorithmpl
    dc.typeArticlepl
    dc.rights.holder© 2005 University of Białystokpl
    dc.rights.holderThis work is licensed under the Creative Commons License.pl
    dc.description.AffiliationUniversity of Victoria, Victoria, Canadapl
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990.pl
    dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.pl
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.pl
    dc.description.referencesGrzegorz Bancerek. Sequences of ordinal numbers. Formalized Mathematics, 1(2):281-290, 1990.pl
    dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.pl
    dc.description.referencesCzesław Byliński. A classical first order language. Formalized Mathematics, 1(4):669–676, 1990.pl
    dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.pl
    dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.pl
    dc.description.referencesCzesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.pl
    dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.pl
    dc.description.referencesKrzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35–40, 1990.pl
    dc.description.referencesJarosław Kotowicz. Monotone real sequences. Subsequences. Formalized Mathematics, 1(3):471–475, 1990.pl
    dc.description.referencesJarosław Kotowicz. Real sequences and basic operations on them. Formalized Mathematics, 1(2):269–272, 1990.pl
    dc.description.referencesGilbert Lee. Walks in Graphs. Formalized Mathematics, 13(2):253–269, 2005.pl
    dc.description.referencesGilbert Lee. Weighted and Labeled Graphs. Formalized Mathematics, 13(2):279–293, 2005.pl
    dc.description.referencesYatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Preliminaries to circuits, I. Formalized Mathematics, 5(2):167–172, 1996.pl
    dc.description.referencesPiotr Rudnicki. Little Bezout theorem (factor theorem). Formalized Mathematics, 12(1):49–58, 2004.pl
    dc.description.referencesPiotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics, 6(3):335–338, 1997.pl
    dc.description.referencesPiotr Rudnicki and Andrzej Trybulec. Multivariate polynomials with arbitrary number of variables. Formalized Mathematics, 9(1):95–110, 2001.pl
    dc.description.referencesAndrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics.pl
    dc.description.referencesAndrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115–122, 1990.pl
    dc.description.referencesAndrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9–11, 1990.pl
    dc.description.referencesAndrzej Trybulec. Many-sorted sets. Formalized Mathematics, 4(1):15–22, 1993.pl
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.pl
    dc.description.referencesJosef Urban. Basic facts about inaccessible and measurable cardinals. Formalized Mathematics, 9(2):323–329, 2001.pl
    dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990.pl
    dc.description.referencesEdmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990.pl
    dc.description.referencesGilbert Lee and Piotr Rudnicki. Alternative graph structures. Formalized Mathematics, 13(2):235–252, 2005.pl
    dc.description.volume13pl
    dc.description.issue2pl
    dc.description.firstpage305pl
    dc.description.lastpage314pl
    dc.identifier.citation2Formalized Mathematicspl
    Występuje w kolekcji(ach):Formalized Mathematics, 2005, Volume 13, Issue 2

    Pliki w tej pozycji:
    Plik Opis RozmiarFormat 
    Correctnesss_of_Ford_Fulkerson’s_Maximum.pdf120,79 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


    Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons