Login / Signup
The Complexity of Finding {$S$}-factors in Regular Graphs.
Sanjana Kolisetty
Linh Le
Ilya Volkovich
Mihalis Yannakakis
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
polynomial time complexity
data sets
computational complexity
memory requirements
graph matching
graph theory
learning algorithm
probabilistic model
worst case
weighted graph
graph mining
factors affecting
graph theoretic
key factors