Randomized algorithms for computer networks
Lead Research Organisation:
University of Leeds
Department Name: Sch of Computing
Abstract
Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.
Organisations
People |
ORCID iD |
Martin Edward Dyer (Principal Investigator) |
Publications
Cooper C
(2019)
The flip Markov chain for connected regular graphs
in Discrete Applied Mathematics
Dyer M
(2019)
Quasimonotone graphs
in Discrete Applied Mathematics
Dyer Martin
(2015)
On the switch Markov chain for perfect matchings
in arXiv e-prints
Dyer M
(2016)
Graph classes and the switch Markov chain for matchings
in Annales de la Faculté des sciences de Toulouse : Mathématiques
Dyer M
(2020)
Random Walks on Small World Networks
in ACM Transactions on Algorithms
Description | Please see the submission of Prof. Colin Cooper, the PI on the grant. |
Sector | Digital/Communication/Information Technologies (including Software) |
Impact Types | Economic |