Filter your results
- 10
- 5
- 4
- 1
- 5
- 10
- 5
- 5
- 7
- 2
- 1
- 10
- 10
- 2
- 2
- 2
- 2
- 10
- 8
- 7
- 2
- 2
- 2
- 2
- 2
- 2
- 1
|
|
sorted by
|
|
Compromis espace-temps pour le problème de k plus courts chemins simplesALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France. pp.4
Conference papers
hal-02835953v1
|
||
k shortest simple pathsSoftware hal-03438331v1 |
|||
|
Finding the k Shortest Simple Paths: Time and Space trade-offs[Research Report] Inria; I3S, Université Côte d'Azur. 2021
Reports
hal-03196830v1
|
||
|
Improving mapping for sparse direct solvers: A trade-off between data locality and load balancingEuroPar 2020 - 26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
Conference papers
hal-02973315v1
|
||
|
Space and time trade-off for the k shortest simple paths problem[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020
Reports
hal-02465317v1
|
||
|
Space and Time Trade-Off for the k Shortest Simple Paths ProblemSEA 2020 - 18th International Symposium on Experimental Algorithms, Jun 2020, Catania, Italy. pp.13, ⟨10.4230/LIPIcs.SEA.2020.18⟩
Conference papers
hal-02865918v1
|
||
|
On finding $k$ earliest arrival time journeys in public transit networks[Research Report] Inria. 2021
Reports
hal-03264788v1
|
||
|
Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
Reports
hal-02491495v1
|
||
|
On the complexity of finding $k$ shortest dissimilar paths in a graph[Research Report] Inria; CNRS; I3S; Université Côte d’Azur. 2021, pp.9
Reports
hal-03187276v2
|
||
|
De la difficulté de trouver des chemins dissimilairesALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2021, La Rochelle, France
Conference papers
hal-03219987v2
|