- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Algorithms (8:4) - Basel : MDPI - S. 810-831
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Technische Universität Berlin
- (when)
-
2019
- Creator
-
Fertin, Guillaume
Komusiewicz, Christian
Mohamed-Babou, Hafedh
Rusu, Irena
- DOI
-
10.14279/depositonce-8725
- Handle
-
11303/9685
- URN
-
urn:nbn:de:101:1-2019080702134649772458
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 AM CEST
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
- Fertin, Guillaume
- Komusiewicz, Christian
- Mohamed-Babou, Hafedh
- Rusu, Irena
- Technische Universität Berlin
Time of origin
- 2019
Other Objects (12)
Heterogeneous Paths to Stability
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
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 Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
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 Disjoint Paths on Directed Acyclic Graphs
Finding k-shortest paths with limited overlap
Finding Temporal Paths Under Waiting Time Constraints
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