Generating Outerplanar Graphs Uniformly at Random
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. A V² Algorithm for Determining Isomorphism of Planar Graphs , 1971, Inf. Process. Lett..
[2] Alain Denise,et al. Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic , 1999, Theor. Comput. Sci..
[3] Refael Hassin,et al. On multicommodity flows in planar graphs , 1984, Networks.
[4] Colin McDiarmid,et al. On the Number of Edges in Random Planar Graphs , 2004, Combinatorics, Probability and Computing.
[5] F. Harary,et al. Planar Permutation Graphs , 1967 .
[6] Therese C. Biedl,et al. Drawing Outer-Planar Graphs in O(n log n) Area , 2002, GD.
[7] Giuseppe Liotta,et al. Proximity Drawings of Outerplanar Graphs , 1996, GD.
[8] Fedor V. Fomin,et al. Approximation of pathwidth of outerplanar graphs , 2001, J. Algorithms.
[9] Jörg-Rüdiger Sack,et al. Generating triangulations at random , 1994, TOMC.
[10] Peter F. Stadler,et al. Minimal Cycle Bases of Outerplanar Graphs , 1998, Electron. J. Comb..
[11] Yuri Gurevich,et al. Average Case Completeness , 1991, J. Comput. Syst. Sci..
[12] T. C. Hu,et al. Combinatorial algorithms , 1982 .
[13] Frank Harary,et al. Graph Theory , 2016 .
[14] Michael A. Langston,et al. Approximation the Pathwidth of Outerplanar Graphs , 1998, Inf. Process. Lett..
[15] Leonid A. Levin,et al. Average Case Complete Problems , 1986, SIAM J. Comput..
[16] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[17] Frank Harary,et al. Graphical enumeration , 1973 .
[18] René Schott,et al. A linear-time algorithm for the generation of trees , 1997, Algorithmica.
[19] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[20] Gilles Schaeffer,et al. Random sampling of large planar maps and convex polyhedra , 1999, STOC '99.
[21] Philippe Flajolet,et al. Properties of Random Triangulations and Trees , 1999, Discret. Comput. Geom..
[22] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[23] Mikhail J. Atallah,et al. Fast Detection and Display of Symmetry in Outerplanar Graphs , 1992, Discret. Appl. Math..
[24] Deryk Osthus,et al. On random planar graphs, the number of planar graphs and their triangulations , 2003, J. Comb. Theory, Ser. B.
[25] Prasad Tetali,et al. On the mixing time of the triangulation walk and other Catalan structures , 1997, Randomization Methods in Algorithm Design.
[26] Edward A. Bender,et al. The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..
[27] Philippe Flajolet,et al. Random maps, coalescing saddles, singularity analysis, and Airy phenomena , 2001, Random Struct. Algorithms.
[28] Sandra Mitchell Hedetniemi. Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs , 1979, Inf. Process. Lett..
[29] Bruce A. Reed,et al. On the mixing rate of the triangulation walk , 1997, Randomization Methods in Algorithm Design.