scientific article; zbMATH DE number 3535592
From MaRDI portal
Publication:4111065
Cited in
(28)- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Categories de Möbius et fonctorialites: un cadre général pour l'inversion de Möbius
- Uniform random generation of expressions respecting algebraic identities
- A Gray code for set partitions
- Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
- A unified approach to data association in multitarget tracking
- New algorithm for nonorthogonal ab initio valence bond calculations. II: Subgraph-driven method
- A constant-time algorithm for middle levels Gray codes
- On constant composition codes
- Uniform random sampling of planar graphs in linear time
- An algorithn for generating a basis of the trades on t-designs
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
- Generating, sampling and counting subclasses of regular tree languages
- Modelling and solving an FMS part selection problem
- Are Two Classes Enough for the X2Goodness of Fit Test?
- Point estimation of a global optimum for large combinatorial problems
- An improved algorithm for finding minimum-risk 3-state-device networks
- Rudin-Shapiro-like polynomials in $L_{4}$
- Beyond series-parallel concurrent systems: the case of arch processes
- On a combinatorial generation problem of Knuth
- Generating unlabeled connected cubic planar graphs uniformly at random
- Fast random generation of binary, t-ary and other types of trees
- New goodness-of-fit test statistics for discrete and grouped continuous data.
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- A combinatorial link between labelled graphs and increasingly labelled Schröder trees
- Kneser graphs are Hamiltonian
- Lexicographic unranking algorithms for the twelvefold way
- Optimal uniform shortest path sampling
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 Q4111065)
