An unbiased pointing operator for unlabeled structures, with applications to counting and sampling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 356-365

  Bodirsky, Manuel ^a   Fusy, Eric ^b   Kang, Mihyun ^a   Vigerske, Stefan ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

CACTUS GRAPHS; COMBINATORIAL STRUCTURES; COUNTING AND SAMPLINGS; GENERAL METHOD; OUTERPLANAR GRAPH; PLANAR MAPS; RNA SECONDARY STRUCTURES; TREE-LIKE STRUCTURES;

TREES (MATHEMATICS);

EID: 84875671607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. -3/2. http://arxiv.org/abs/math.CO/0512432, 2005.
2. F. Bergeron, G. Labelle, and P. Leroux. Combinatorial Species and Tree-like Structures. Cambridge University Press, 1997.
3. M. Bodirsky, É. Fusy, M. Kang, and S. Vigerske. Enumeration of unlabeled outerplanar graphs. Submitted, 2006.
4. M. Bodirsky and M. Kang. Generating outerplanar graphs uniformly at random. Comb. Prob. and Computing, 15:333-343, 2006.
5. P. Cameron. Permutation groups. Cambridge University Press, 1999.
6. P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer. Random sampling from Boltzmann principles. In ICALP'02, LNCS, pages 501-513, 2002.
7. P. Flajolet and R. Sedgewick. Analytic Combinatorics. 2006. Book in preparation: available at http://algo. inria.fr/flajolet/Publications/books.html.
8. P. Flajolet, P. Zimmerman, and B. Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1-2):1-35, 1994.
9. É. Fusy. Counting unrooted maps using treedecomposition. In Proceedings of FPSAC, 2005.
10. É. Fusy, P. Flajolet, and C. Pivoteau. Boltzmann sampling of unlabelled structures, 2006. Forthcoming.
11. F. Harary and E. M. Palmer. Graphical Enumeration. Academic Press, New York and London, 1973.
12. P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford University Press, 2004.
13. J. A. Howell, T. F. Smith, and M. S. Waterman. Computation of generating functions for biological molecules. SIAM J. Appl. Math., 39:119-133, 1980.
14. M. Jerrum. Uniform sampling modulo a group of symmetries using markov chain simulation. Technical Report ECS-LFCS-94-288, Univ. Edinburgh, 1994.
15. V. Liskovets. A census of non-isomorphic planar maps. In Coll. Math. Soc. J. Bolyai, Proc. Conf. Algebr. Meth. in Graph Th., volume 25:2, pages 479-494, 1981.
16. A. Nijenhuis and H. Wilf. Combinatorial algorithms. Academic Press Inc., 1979.
17. Otter. The number of trees. Annals of Math., 49:583-599, 1948.
18. N. Sloane. A000602: Number of n-node unrooted quartic trees. http://www.research.att.com/~njas/sequences/A000602, 2003.
19. W. T. Tutte. A census of planar maps. Canad. J. Math., 15:249-271, 1963.
20. H. S. Wilf. The uniform selection of free trees. J. Algorithms, 2(2):204-207, 1981.