The hardness of sampling connected subgraphs
From MaRDI portal
Publication:2081646
DOI10.1007/978-3-030-61792-9_37OpenAlexW3108527933MaRDI QIDQ2081646
Andrew Read-McFarland, Daniel Štefanković
Publication date: 13 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-61792-9_37
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
This page was built for publication: The hardness of sampling connected subgraphs
