- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Deutsch
- Anmerkungen
-
Berlin, Humboldt-Universität zu Berlin, Dissertation, 2023
- Schlagwort
-
Graph
Berechnungskomplexität
Dekomposition
NP-hartes Problem
Effizienter Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2023
- Urheber
- Beteiligte Personen und Organisationen
-
Kratsch, Stefan
Siebertz, Sebastian
Nederlof, Jesper
- DOI
-
10.18452/27478
- URN
-
urn:nbn:de:kobv:11-110-18452/28211-7
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 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.
Beteiligte
- Hegerfeld, Falko
- Kratsch, Stefan
- Siebertz, Sebastian
- Nederlof, Jesper
- Humboldt-Universität zu Berlin
Entstanden
- 2023
Ähnliche Objekte (12)
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained multilayer virtualized systems analysis
Fine-Grained Complexity of Safety Verification
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
Parallel parameterized algorithms
b-Coloring Parameterized by Clique-Width
Fine-grained Distributed Application Monitoring Using LTTng
Fine-grained recognition of plants from images
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained multilayer virtualized systems analysis
Fine-Grained Complexity of Safety Verification
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
Parallel parameterized algorithms
b-Coloring Parameterized by Clique-Width
Fine-grained Distributed Application Monitoring Using LTTng
Fine-grained recognition of plants from images
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained multilayer virtualized systems analysis
Fine-Grained Complexity of Safety Verification
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
Parallel parameterized algorithms
b-Coloring Parameterized by Clique-Width
Fine-grained Distributed Application Monitoring Using LTTng