Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs.
Bart M. P. JansenShivesh Kumar RoyPublished in: IPEC (2023)
Keyphrases
- sparse approximation
- sparse representation
- regularized least squares
- graph kernels
- maximum weight
- high dimensional
- weighted graph
- maximum clique
- edge weights
- labeled graphs
- minimum weight
- directed graph
- undirected graph
- sparse kernel
- attributed graphs
- association graph
- independent set
- sparsity constraints
- kernel function
- compressive sensing
- compressive sampling
- sparse coding
- hamiltonian cycle
- graph properties
- reproducing kernel hilbert space
- graph matching
- support vector
- kernel methods
- quasi cliques
- hilbert space
- bipartite graph
- mixed norm
- feature space
- basis pursuit
- maximum cardinality
- connected subgraphs
- vertex set
- compressed sensing
- graph databases
- graph model
- gaussian process
- graph structure
- similarity function
- linear combination
- packing problem
- graph theoretic
- betweenness centrality
- gaussian processes
- additive models
- regularized regression