Approximately counting cliques

DOI10.1002/(SICI)1098-2418(199712)11:4%3C395::AID-RSA7%3E3.0.CO;2-UMaRDI QIDQ4372790zbMATH OpenOpenAlexFDO

Authors Lars Rasmussen

Publication date 17 December 1997

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199712)11:4%3C395::aid-rsa7%3E3.0.co;2-u

zbMATH Keywords

approximation algorithmcounting cliquesrandom graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 1444472
• On approximating the number of k-cliques in sublinear time
• On approximating the number of k-cliques in sublinear time
• Cliques in random graphs
• Computing the partition function for cliques in a graph

Cited in

(12)

• Excluding a countable clique
• On cliques and bicliques
• The sum of degrees in cliques
• Sequential Monte Carlo for counting vertex covers in general graphs
• Odd pairs of cliques
• Model counting of monotone conjunctive normal form formulas with spectra
• Computing the partition function for cliques in a graph
• scientific article; zbMATH DE number 1444472 (Why is no real title available?)
• On approximating the number of k-cliques in sublinear time
• Stochastic enumeration method for counting trees
• Approximately counting embeddings into random graphs
• How many cliques can a clique cover cover?

This page was built for publication: Approximately counting cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372790)