Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs.
Talya EdenDana RonWill RosenbaumPublished in: ICALP (2022)
Keyphrases
- asymptotically optimal
- worst case
- binary search trees
- graph structure
- tight bounds
- maximal cliques
- upper bound
- optimal cost
- optimal solution
- sample size
- monte carlo
- closed form
- error bounds
- weighted graph
- regret bounds
- bounded treewidth
- graph databases
- maximum clique
- sampling strategy
- upper and lower bounds
- spanning tree
- graph matching
- np complete
- data structure