Approximate Sampling and Counting of Graphs with Near-P-stable Degree Intervals
Erdős, Péter and Mezei, Tamás Róbert and Miklós, István (2024) Approximate Sampling and Counting of Graphs with Near-P-stable Degree Intervals. ANNALS OF COMBINATORICS, 28. pp. 223-256. ISSN 0218-0006 10.1007/s00026-023-00678-8
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
Erdos_223_32788518_ny.pdf Download (750kB) |
Official URL: https://doi.org/10.1007/s00026-023-00678-8
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 13 Apr 2024 08:48 |
| Last Modified: | 13 Apr 2024 08:48 |
| URI: | https://eprints.sztaki.hu/id/eprint/10717 |
 |
Update Item |
