The max clique problem in classes of string-graphs
Year of publication: |
1988
|
---|---|
Authors: | Middendorf, M. ; Pfeiffer, Frank |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik |
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
Extent: | 9 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 |
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
-
Eirinakis, Pavlos, (2024)
-
A hybrid ANN-MILP model for agile recovery production planning for PPE products under sharp demands
Babazadeh, Reza, (2025)
- More ...
-
On the complexity of recognizing perfectly orderable graphs
Middendorf, M., (1989)
-
On the complexity of the disjoint path problem
Middendorf, M., (1989)
-
Routing multiterminal nets via disjoint connected t-joins
Middendorf, M., (1988)
- More ...