Sampling arbitrary subgraphs exactly uniformly in sublinear time

Fichtenberger, H., Gao, M. and Peng, P. (2020) Sampling arbitrary subgraphs exactly uniformly in sublinear time. In: Czumaj, A., Dawar, A. and Merelli, E., (eds.) The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020). The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), 08-11 Jul 2020, Saarbrücken, Germany. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 45:1-45:13. ISBN 9783959771382

Abstract

Metadata

Authors/Creators:
  • Fichtenberger, H.
  • Gao, M.
  • Peng, P.
Copyright, Publisher and Additional Information: © 2020 The Authors. Licensed under Creative Commons License CC-BY (https://creativecommons.org/licenses/by/3.0/).
Keywords: Graph sampling; Graph algorithms; Sublinear-time algorithms
Dates:
  • Accepted: 15 April 2020
  • Published (online): 29 June 2020
  • Published: 29 June 2020
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 05 May 2020 11:02
Last Modified: 02 Jul 2020 09:26
Status: Published
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
Refereed: Yes
Identification Number: https://doi.org/10.4230/LIPIcs.ICALP.2020.45

Share / Export

Statistics