Login / Signup
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers.
Davide Bilò
Gianlorenzo D'Angelo
Luciano Gualà
Stefano Leucci
Guido Proietti
Mirko Rossi
Published in:
CoRR (2021)
Keyphrases
</>
single source
disjoint paths
shortest path problem
shortest path
directed graph
multi source
approximation algorithms
neural network
data mining
state space
worst case
gray scale