Approximating the minimum clique cover and other hard problems in subtree filament graphs.

J. Mark Keil Lorna Stewart

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

Keyphrases

hard problems
subgraph isomorphism
independent set
maximum clique
phase transition
spanning tree
quasi cliques
graph properties
graph theory
graph matching
graph mining
hyper heuristics
directed graph
graph databases
particle swarm optimization
random graphs
heuristic search
metaheuristic