Erdős, Péter and Király, Zoltán and Miklós, István (2013) On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. COMBINATORICS PROBABILITY AND COMPUTING, 22 (3). pp. 366-383. ISSN 0963-5483
|
Text
EKM-arXiv1205.2842v3.pdf Download (186kB) | Preview |
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Problem solving; Markov processes; Graph theory; Upper Bound; Uniform sampling; Rapidly mixing; Markov chain approaches; Integer sequence; Greedy algorithms; Degree sequence |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 06 Feb 2014 21:48 |
| Last Modified: | 06 Feb 2014 21:48 |
| URI: | http://real.mtak.hu/id/eprint/10113 |
Actions (login required)
 |
Edit Item |
