scientific article
From MaRDI portal
Publication:3470467
zbMath0695.05002MaRDI QIDQ3470467
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random graphsenumeration of graphsfree treesGray code generationrandom sampling pairsranking and unrankingvariants of Gray code
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Statistical ranking and selection procedures (62F07) Combinatorial codes (94B25) Probabilistic methods, stochastic differential equations (65C99) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
A calculus for the random generation of labelled combinatorial structures ⋮ Hamilton-connected derangement graphs on \(S_ n\) ⋮ Doubly adjacent gray codes for the symmetric group ⋮ A ranking algorithm for Hamilton paths in shuffle-exchange graphs ⋮ Synthetic sequence design for signal location search ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Random generation of colored trees ⋮ Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints ⋮ Covering moving points with anchored disks ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ Palindromic subshifts and simple periodic groups of intermediate growth ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ A heuristic method for generating large random expressions ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ A counting formula for labeled, rooted forests ⋮ Rainbow Cycles in Flip Graphs ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Generating random binary trees -- a survey ⋮ Rainbow Cycles in Flip Graphs. ⋮ Combinatorial families that are exponentially far from being listable in Gray code sequence ⋮ Gray codes from antimatroids
