Login / Signup
FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
Stéphane Bessy
Florian Hörsch
Ana Karolinna Maia
Dieter Rautenbach
Ignasi Sau
Published in:
CoRR (2021)
Keyphrases
</>
learning algorithm
computational cost
graph theory
benchmark datasets
orders of magnitude
data structure
computationally efficient
machine learning algorithms
times faster
combinatorial optimization
graph structure