There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).

Luisa Gargano Mikael Hammar

Published in: ICALP (2003)

Keyphrases

quasi cliques
graph theoretic
graph matching
graph theory
structured objects
dense optical flow
object recognition
graph mining
real time
graph databases
graph model
densely connected
graph construction
random graphs
small world
probabilistic model
search algorithm
data structure
neural network
data sets