Approximately counting cliques

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199712)11:4<395::AID-RSA7>3.0.CO;2-U" /><395::AID-RSA7>3.0.CO;2-U 10.1002/(SICI)1098-2418(199712)11:4<395::AID-RSA7>3.0.CO;2-UzbMath0889.05055OpenAlexW2032789786MaRDI QIDQ4372790

Lars Rasmussen

Publication date: 17 December 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199712)11:4<395::aid-rsa7>3.0.co;2-u

zbMATH Keywords

approximation algorithmrandom graphcounting cliques

Mathematics Subject Classification ID

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

Related Items (4)

Sequential Monte Carlo for counting vertex covers in general graphs ⋮ Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra ⋮ Stochastic enumeration method for counting trees ⋮ Approximately Counting Embeddings into Random Graphs

This page was built for publication: Approximately counting cliques