Counting cliques and clique covers in random graphs
Kashyap Dixit,
Martin Fürer
Abstract:We study the problem of counting the number of isomorphic copies of a given template graph, say H, in the input base graph, say G. In general, it is believed that polynomial time algorithms that solve this problem exactly are unlikely to exist. So, a lot of work has gone into designing efficient approximation schemes, especially, when H is a perfect matching. In this work, we present efficient approximation schemes to count k-Cliques, k-Independent sets and k-Clique covers in random graphs.We present fully pol… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.