- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Algorithms (8:4) - Basel : MDPI - S. 810-831
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2019
- Urheber
-
Fertin, Guillaume
Komusiewicz, Christian
Mohamed-Babou, Hafedh
Rusu, Irena
- DOI
-
10.14279/depositonce-8725
- Handle
-
11303/9685
- URN
-
urn:nbn:de:101:1-2019080702134649772458
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07: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.
Beteiligte
- Fertin, Guillaume
- Komusiewicz, Christian
- Mohamed-Babou, Hafedh
- Rusu, Irena
- Technische Universität Berlin
Entstanden
- 2019
Ähnliche Objekte (12)
Heterogeneous Paths to Stability
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
Finding Disjoint Paths on Directed Acyclic Graphs
Finding the path(s) towards profitable e-commerce
Heterogeneous dirhodium catalysts: from supported to self-supported systems
Finding relevant semantic association paths through user-specific intermediate entities
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Finding Common Patterns In Heterogeneous Perturbation Data
Heterogeneous Paths to Stability
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
Finding Disjoint Paths on Directed Acyclic Graphs
Finding the path(s) towards profitable e-commerce
Heterogeneous dirhodium catalysts: from supported to self-supported systems
Finding relevant semantic association paths through user-specific intermediate entities
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Finding Common Patterns In Heterogeneous Perturbation Data
Heterogeneous Paths to Stability
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
Finding Disjoint Paths on Directed Acyclic Graphs
Finding the path(s) towards profitable e-commerce
Heterogeneous dirhodium catalysts: from supported to self-supported systems
Finding relevant semantic association paths through user-specific intermediate entities
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances