de
en
Close
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
jump to main content
Search Details
Quicksearch:
OK
Title
Title
Content
Content
Page
Page
Search Book
Bibliographic Metadata
Title
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
/ von Norbert Sensen
Author
Sensen, Norbert
Published
2003
Institutional Note
Paderborn, Univ., Diss., 2003
Language
English
Document Types
Dissertation (PhD)
Keywords (GND)
Graph
/
Dekomposition
/
Untere Schranke
/
Mehrgüter-Fluss-Problem
/
Branch-and-Bound-Methode
URN
urn:nbn:de:hbz:466-20030101341
Links
Social Media
Share
Reference
Universitätsbibliothek Paderborn
IIIF
IIIF Manifest
Download
Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
[
987.58 kb
]
zusfasng
[
40.42 kb
]
abstract
[
36.41 kb
]
ris
Classification
Besondere Sammlungen
Veröffentlichungen der Universität
Fakultät für Elektrotechnik, Informatik und Mathematik
Institut für Informatik
Content
Contents of this Book
Stats
The PDF-Document has been downloaded
84
times.
License/Rightsstatement
In Copyright