Login / Signup
Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts.
Radu Curticapean
Dániel Marx
Published in:
CoRR (2014)
Keyphrases
</>
vertex cover
computational complexity
space complexity
worst case
search algorithm
greedy algorithm
search space
special case
sufficient conditions
theoretical analysis