Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time - MaRDI portal

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time

From MaRDI portal

Publication:6090913

Jump to:navigation, search

DOI10.4230/LIPICS.APPROX/RANDOM.2021.55arXiv2107.06582OpenAlexW3202472937MaRDI QIDQ6090913

Talya Eden, Amartya Shankha Biswas, Ronitt Rubinfeld

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2107.06582

zbMATH Keywords

graph algorithms approximate counting sublinear time algorithms sampling subgraphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

This page was built for publication: Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6090913&oldid=35532959"