SENSEN, Norbert, 2003. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows.
Elsevier - Harvard (with titles)Sensen, N., 2003. Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. https://doi.org/urn:nbn:de:hbz:466-20030101341
American Psychological Association 7th editionSensen, N. (ca. 2003). Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows [Cd]. https://doi.org/urn:nbn:de:hbz:466-20030101341
Springer - Basic (author-date)Sensen N (2003) Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
Juristische Zitierweise (Stüber) (Deutsch)Sensen, Norbert, Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows, 2003.
Bitte prüfen Sie die Zitate auf Korrektheit, bevor Sie diese in Ihre Arbeit einfügen.