Hochschulschrift
Algorithmic graph minor theory : approximation, parameterized complexity, and practical aspects
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
X, 212 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Berlin, Humboldt-Univ., Diss., 2010
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:22 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized approximation algorithms for orienteering
Parameterized Complexity of Graph Burning
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized approximation algorithms for orienteering
Parameterized Complexity of Graph Burning
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized approximation algorithms for orienteering
Parameterized Complexity of Graph Burning
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems