Login / Signup
A polynomial time algorithm for the triangle packing problem on interval graphs.
Young-Soo Myung
Published in:
Discret. Appl. Math. (2024)
Keyphrases
</>
packing problem
worst case
computational complexity
bin packing
dynamic programming
np hard
k means
learning algorithm
search space
objective function
optimal solution
np complete
random graphs
graph isomorphism
polynomial time complexity