Fast algorithms for identifying maximal common connected sets of interval graphs.

Fabien Coulon Mathieu Raffinot

Published in: Discret. Appl. Math. (2006)

Keyphrases

learning algorithm
computational complexity
times faster
significant improvement
graph theory
data mining
optimization problems
theoretical analysis
orders of magnitude
decision trees
random graphs