Breaking quadratic time for small vertex connectivity and an approximation scheme.
Danupon NanongkaiThatchaphol SaranurakSorrachai YingchareonthawornchaiPublished in: STOC (2019)
Keyphrases
- polynomial time approximation
- approximation schemes
- randomized approximation
- approximation algorithms
- small number
- error bounds
- random walk
- pairwise
- data sets
- learning scheme
- objective function
- learning algorithm
- polynomial approximation
- special case
- closed form
- connected components
- computational complexity
- detection scheme
- network connectivity
- strongly connected
- linear computational complexity
- neural network