Generating unlabeled connected cubic planar graphs uniformly at random
暂无分享,去创建一个
[1] W. T. Tutte,et al. A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.
[2] W. G. Brown. Enumeration of Triangulations of the Disk , 1964 .
[3] W. T. Tutte. On the enumeration of convex polyhedra , 1980, J. Comb. Theory, Ser. B.
[4] C. Itzykson,et al. Quantum field theory techniques in graphical enumeration , 1980 .
[5] Valery A. Liskovets,et al. Enumeration of nonisomorphic planar maps , 1981, J. Graph Theory.
[6] Timothy R. S. Walsh,et al. Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs , 1982, J. Comb. Theory, Ser. B.
[7] Timothy R. S. Walsh,et al. Counting labelled three-connected and homeomorphically irreducible two-connected graphs , 1982, J. Comb. Theory, Ser. B.
[8] Timothy R. S. Walsh,et al. Counting non-isomorphic three-connected planar maps , 1982, J. Comb. Theory, Ser. B.
[9] V. Liskovets,et al. The Enumeration of Non-Isomorphic 2-Connected Planar Maps , 1983, Canadian Journal of Mathematics.
[10] Herbert S. Wilf,et al. Combinatorial Algorithms: An Update , 1987 .
[11] Philippe Flajolet,et al. A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..
[12] Reinhard Diestel,et al. Graph Theory , 1997 .
[13] Prasad Tetali,et al. On the mixing time of the triangulation walk and other Catalan structures , 1997, Randomization Methods in Algorithm Design.
[14] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[15] Bruce A. Reed,et al. On the mixing rate of the triangulation walk , 1997, Randomization Methods in Algorithm Design.
[16] Mark Jerrum,et al. Mathematical Foundations of the Markov Chain Monte Carlo Method , 1998 .
[17] Nicholas C. Wormald,et al. The Size of the Largest Components in Random Planar Maps , 1999, SIAM J. Discret. Math..
[18] P. Francesco. Matrix model combinatorics: applications to folding and coloring , 1999, math-ph/9911002.
[19] Nicholas C. Wormald,et al. The Distribution of the Maximum Vertex Degree in Random Planar Maps , 2000, J. Comb. Theory, Ser. A.
[20] P. Francesco,et al. Census of planar maps: From the one-matrix model solution to a combinatorial proof , 2002, cond-mat/0207682.
[21] Edward A. Bender,et al. The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..
[22] Brendan D. McKay,et al. Symmetric drawings of triconnected planar graphs , 2002, SODA '02.
[23] N. Wormald,et al. Enumeration of Rooted Cubic Planar Maps , 2002 .
[24] Nicolas Bonichon,et al. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation , 2003, WG.
[25] Deryk Osthus,et al. On random planar graphs, the number of planar graphs and their triangulations , 2003, J. Comb. Theory, Ser. B.
[26] Nicolas Bonichon,et al. An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation , 2003, STACS.
[27] P. Francesco,et al. Combinatorics of hard particles on planar graphs , 2002, cond-mat/0211168.
[28] Dominique Poulalhon,et al. Optimal Coding and Sampling of Triangulations , 2003, ICALP.
[29] Manuel Bodirsky,et al. Generating Labeled Planar Graphs Uniformly at Random , 2003, ICALP.
[30] Peter Eades,et al. Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs , 2004, Algorithmica.
[31] 2D QUANTUM GRAVITY,MATRIX MODELS AND GRAPH COMBINATORICS , 2004, math-ph/0406013.
[32] Colin McDiarmid,et al. On the Number of Edges in Random Planar Graphs , 2004, Combinatorics, Probability and Computing.
[33] Omer Giménez,et al. Asymptotic enumeration and limit laws of planar graphs , 2005, math/0501269.
[34] Colin McDiarmid,et al. Random planar graphs with n nodes and a fixed number of edges , 2005, SODA '05.
[35] Peter Eades,et al. Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs , 2005, Algorithmica.
[36] Colin McDiarmid,et al. Random planar graphs , 2005, J. Comb. Theory B.
[37] M. Loebl,et al. The enumeration of planar graphs via Wick's theorem , 2006, math/0605218.
[38] Manuel Bodirsky,et al. Generating Outerplanar Graphs Uniformly at Random , 2006, Combinatorics, Probability and Computing.
[39] C. McDiarmid,et al. Random Graphs from Planar and Other Addable Classes , 2006 .
[40] Dominique Poulalhon,et al. Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.
[41] G. Grimmett,et al. Combinatorics, complexity, and chance : a tribute to Dominic Welsh , 2007 .
[42] Manuel Bodirsky,et al. An unbiased pointing operator for unlabeled structures, with applications to counting and sampling , 2007, SODA '07.
[43] Manuel Bodirsky,et al. Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs , 2007, Electron. J. Comb..
[44] C. Gröpl,et al. A direct decomposition of 3-connected planar graphs , 2007 .
[45] C. McDiarmid,et al. Random cubic planar graphs , 2007 .
[46] B. McKay,et al. Fast generation of planar graphs , 2007 .
[47] C. McDiarmid,et al. RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE , 2007 .
[48] Marc Noy,et al. Enumeration and limit laws for series-parallel graphs , 2007, Eur. J. Comb..
[49] Anusch Taraz,et al. The random planar graph process , 2008, Random Struct. Algorithms.
[50] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .