Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs.

Saved in:

Bibliographic Details
Title:	Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs.
Authors:	BRESSAN, MARCO¹, marco.bressan@unimi.it
Source:	ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-40, 40p
Database:	Applied Science & Technology Source

Description
ISSN:	15496325
DOI:	10.1145/3596495