-norm Solvers in Slightly Dense Graphs via Sparsification.
Deeksha AdilBrian BullinsRasmus KyngSushant SachdevaPublished in: CoRR (2021)
Keyphrases
- regularization method
- quasi cliques
- graph matching
- graph theoretic
- graph representation
- graph mining
- computationally hard problems
- least squares
- graph databases
- graph partitioning
- sat solvers
- densely connected
- weighted graph
- graph theory
- graph clustering
- graph structures
- bipartite graph
- series parallel
- sat solving
- directed graph
- neural network