On the complexity of the disjoint path problem
Year of publication: |
1989
|
---|---|
Authors: | Middendorf, M. ; Pfeiffer, Frank |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Komplexitätsmanagement | Complexity management |
Extent: | 23 S. graph. Darst. |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Algorithms and time complexity of the request-service problem
Liu, Chunmei, (2010)
-
On the information-based complexity of stochastic programming
Tavares, Gabriela, (2013)
-
Wöllenstein, Christian, (2010)
- More ...
-
On the complexity of recognizing perfectly orderable graphs
Middendorf, M., (1989)
-
Routing multiterminal nets via disjoint connected t-joins
Middendorf, M., (1988)
-
The max clique problem in classes of string-graphs
Middendorf, M., (1988)
- More ...