Fast enumeration algorithms for non-crossing geometric graphs.

Naoki Katoh Shin-ichi Tanigawa

Published in: SCG (2008)

Keyphrases

theoretical analysis
learning algorithm
feature selection
orders of magnitude
computational cost
graph theory
data sets
machine learning
dynamic programming
times faster
maximal clique enumeration