Deterministic Parameterized Algorithms for the Graph Motif Problem.

Ron Y. Pinter Hadas Shachnai Meirav Zehavi

Published in: MFCS (2) (2014)

Keyphrases

learning algorithm
computationally efficient
data mining
worst case
theoretical analysis
randomized algorithms
bayesian networks
computational complexity
significant improvement
computational cost
random walk
black box
variable length
maximum flow