On the minimum size of visibility graphs.

Alfredo García Olaverri Ferran Hurtado Marc Noy Javier Tejel

Published in: Inf. Process. Lett. (2002)

Keyphrases

graph matching
graph theoretic
genetic algorithm
bayesian networks
object recognition
spanning tree
graph partitioning
maximal cliques
constant factor
maximum clique
square error
data sets
minimum cost
graph representation
pruning power
connected dominating set