scientific article; zbMATH DE number 4137767
From MaRDI portal
Publication:3470467
enumeration of graphsfree treesGray code generationrandom graphsrandom sampling pairsranking and unrankingvariants of Gray code
Software, source code, etc. for problems pertaining to combinatorics (05-04) Trees (05C05) Enumeration in graph theory (05C30) Statistical ranking and selection procedures (62F07) Probabilistic methods, stochastic differential equations (65C99) Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Combinatorial codes (94B25)
Recommendations
Cited in
(29)- A heuristic method for generating large random expressions
- Gray codes from antimatroids
- A calculus for the random generation of labelled combinatorial structures
- Hamilton-connected derangement graphs on \(S_ n\)
- Palindromic subshifts and simple periodic groups of intermediate growth
- Generating random binary trees -- a survey
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Restricted compositions and permutations: from old to new Gray codes
- A constant-time algorithm for middle levels Gray codes
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Synthetic sequence design for signal location search
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- Covering moving points with anchored disks
- Doubly adjacent gray codes for the symmetric group
- scientific article; zbMATH DE number 704893 (Why is no real title available?)
- Efficient enumeration of ordered trees with \(k\) leaves
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 867670 (Why is no real title available?)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- A ranking algorithm for Hamilton paths in shuffle-exchange graphs
- Random generation of colored trees
- Rainbow cycles in flip graphs
- Rainbow cycles in flip graphs
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- A counting formula for labeled, rooted forests
- A note on Beckett-Gray codes and the relationship of Gray codes to data structures
- Spin-s U(1)-Eigenstate preparation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470467)
