Login / Signup
A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs.
Gustavo Sacomoto
Vincent Lacroix
Marie-France Sagot
Published in:
Algorithms Mol. Biol. (2015)
Keyphrases
</>
directed graph
polynomial delay
learning algorithm
dynamic programming
np hard
computational complexity
search space
worst case
clustering method
spanning tree
recommender systems
k means
random walk
graph mining
data complexity