It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness. Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs.
| YEAR | Impact Factor |
|---|---|
| 2023-24 | 0.9 |
| 2022 | NA |
| 2021 | 1.131 |
RANDOM STRUCTURES & ALGORITHMS, 1042-9832, 1990-ongoing, Computer Science,Mathematics.