Approximately Counting Embeddings into Random Graphs
From MaRDI portal
Publication:5891884
DOI10.1017/S0963548314000339zbMath1302.05186MaRDI QIDQ5891884
Shiva Prasad Kasiviswanathan, Martin Fuerer
Publication date: 14 November 2014
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- The complexity of computing the permanent
- Random generation of combinatorial structures from a uniform distribution
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Pattern associativity and the retrieval of semantic networks
- FSTTCS 2004: Foundations of software technology and theoretical computer science. 24th international conference, Chennai, India, December 16--18, 2004. Proceedings.
- An analysis of Monte Carlo algorithm for estimating the permanent
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Polynomial-Time Approximation Algorithms for the Ising Model
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
- Approximating the Permanent
- Counting the Number of Hamilton Cycles in Random Digraphs
- Estimating the Efficiency of Backtrack Programs
- Approximately Counting Hamilton Paths and Cycles in Dense Graphs
- Approximating the permanent: A simple approach
- Color-coding
- Approximately counting cliques
- Spanning Subgraphs of Random Graphs
- The Parameterized Complexity of Counting Problems
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- Generating and Counting Hamilton Cycles in Random Regular Graphs
- Sampling binary contingency tables with a greedy start
This page was built for publication: Approximately Counting Embeddings into Random Graphs
