Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree.

John Engbers David J. Galvin

Published in: J. Graph Theory (2014)

Keyphrases

fixed size
variable size
sliding window
window size
random graphs
graph matching
spanning tree
directed graph
graph theoretic
subsequence matching
weighted graph
graph mining
data sets
graph theory
bipartite graph
ground truth
computational complexity
video sequences