- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Humboldt-Universität zu Berlin, Dissertation, 2023
- Schlagwort
-
Kürzester-Weg-Problem
Berechnungskomplexität
Algorithmus
NP-hartes Problem
Parametrisierte Komplexität
Effizienter Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2023
- Urheber
- Beteiligte Personen und Organisationen
-
Kratsch, Stefan
Friedrich, Tobias
Kreutzer, Stephan
- DOI
-
10.18452/26639
- URN
-
urn:nbn:de:kobv:11-110-18452/27721-5
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:46 MEZ
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
- Nelles, Florian
- Kratsch, Stefan
- Friedrich, Tobias
- Kreutzer, Stephan
- Humboldt-Universität zu Berlin
Entstanden
- 2023
Ähnliche Objekte (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