On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs (Q5865698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs |
scientific article; zbMATH DE number 7539114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs |
scientific article; zbMATH DE number 7539114 |
Statements
On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs (English)
0 references
9 June 2022
0 references
proper edge coloring
0 references
one-factorization
0 references
local minimum coloring
0 references
complete graph
0 references
mild random walk algorithm
0 references
0 references
