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:
Discret. Appl. Math. (2024)
Keyphrases
</>
graph theory
learning algorithm
computational cost
computationally efficient
orders of magnitude
times faster
theoretical analysis
benchmark datasets
polynomial time complexity
np complete
constraint programming
maximum clique