Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs.
Amit LeviErik WaingartenPublished in: CoRR (2018)
Keyphrases
- lower bound
- upper bound
- optimal solution
- objective function
- branch and bound algorithm
- test cases
- lower and upper bounds
- random sampling
- branch and bound
- graph matching
- quadratic assignment problem
- sampling algorithm
- directed graph
- graph theory
- monte carlo
- graph mining
- sample size
- np hard
- spanning tree
- graph clustering
- random graphs
- graph kernels
- special case
- sampling strategy
- uniform random