-Norm Solvers in Slightly Dense Graphs via Sparsification.
Deeksha AdilBrian BullinsRasmus KyngSushant SachdevaPublished in: ICALP (2021)
Keyphrases
- regularization method
- computationally hard problems
- graph mining
- objective function
- graph matching
- graph theoretic
- quasi cliques
- tikhonov regularization
- series parallel
- graph structures
- graph databases
- data sets
- graph clustering
- graph kernels
- graph partitioning
- graph construction
- random graphs
- weighted graph
- structured data
- orders of magnitude
- least squares
- social networks
- neural network