Approximately Counting Embeddings into Random Graphs

DOI10.1007/978-3-540-85363-3_33zbMath1159.05321OpenAlexW1610094221MaRDI QIDQ5900477

Shiva Prasad Kasiviswanathan, Martin Fuerer

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_33

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: Approximately Counting Embeddings into Random Graphs