On the number of connected sets with the neighborhood of a given size in a graph.

Alexander A. Sapozhenko

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

Keyphrases

maximum number
computational complexity
small number
grow exponentially
data sets
case study
directed graph
space complexity
graph representation
neighborhood graph
total length