Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximately Counting Embeddings into Random Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Mathematics of Operations Research
Faster Algorithms for Sampling and Counting Biological Sequences
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On the hardness of counting and sampling center strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
Complexity of the cover polynomial
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the Hardness of Counting and Sampling Center Strings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We describe fully polynomial randomized approximation schemes for the problems of determining the number of Hamilton paths and cycles in an n-vertex graph with minimum degree $(\frac{1}{2}+\a)n$, for any fixed a 0. We show that the exact counting problems are \#P-complete. We also describe fully polynomial randomized approximation schemes for counting paths and cycles of all sizes in such graphs.