- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Humboldt-Universität zu Berlin, Dissertation, 2023
- Keyword
-
Kürzester-Weg-Problem
Berechnungskomplexität
Algorithmus
NP-hartes Problem
Parametrisierte Komplexität
Effizienter Algorithmus
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Humboldt-Universität zu Berlin
- (when)
-
2023
- Creator
- Contributor
-
Kratsch, Stefan
Friedrich, Tobias
Kreutzer, Stephan
- DOI
-
10.18452/26639
- URN
-
urn:nbn:de:kobv:11-110-18452/27721-5
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Nelles, Florian
- Kratsch, Stefan
- Friedrich, Tobias
- Kreutzer, Stephan
- Humboldt-Universität zu Berlin
Time of origin
- 2023
Other Objects (12)
Parallel parameterized algorithms
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Space-efficient Basic Graph Algorithms
Efficient Graph Algorithms in Neo4j
Algorithms and experiments for parameterized approaches to hard graph problems
Efficient visual navigation of hierarchically structured graphs
Parameterized approximation algorithms for orienteering
Efficient pareto frontier algorithms for computing structured signal representations
Graph separators - a parameterized view
Efficient generation and execution of DAG-structured query graphs
Efficient generation and execution of DAG-structured query graphs
Efficient schemes for parameterized multiscale problems
Parallel parameterized algorithms
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Space-efficient Basic Graph Algorithms
Efficient Graph Algorithms in Neo4j
Algorithms and experiments for parameterized approaches to hard graph problems
Efficient visual navigation of hierarchically structured graphs
Parameterized approximation algorithms for orienteering
Efficient pareto frontier algorithms for computing structured signal representations
Graph separators - a parameterized view
Efficient generation and execution of DAG-structured query graphs
Efficient generation and execution of DAG-structured query graphs
Efficient schemes for parameterized multiscale problems
Parallel parameterized algorithms
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Space-efficient Basic Graph Algorithms
Efficient Graph Algorithms in Neo4j
Algorithms and experiments for parameterized approaches to hard graph problems
Efficient visual navigation of hierarchically structured graphs
Parameterized approximation algorithms for orienteering
Efficient pareto frontier algorithms for computing structured signal representations
Graph separators - a parameterized view
Efficient generation and execution of DAG-structured query graphs
Efficient generation and execution of DAG-structured query graphs