Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.
Florian BarberoGregory Z. GutinMark JonesBin ShengAnders YeoPublished in: Inf. Process. Lett. (2016)
Keyphrases
- directed graph
- graph kernels
- undirected graph
- vertex set
- labeled graphs
- graph representation
- maximum cardinality
- attributed graphs
- edge weights
- hamiltonian cycle
- structured data
- path length
- bipartite graph
- graph theory
- disjoint paths
- graph model
- minimum weight
- graph structure
- kernel methods
- kernel function
- shortest path
- strongly connected
- graph theoretic
- series parallel
- regularized least squares
- graph embedding
- hilbert space
- positive definite
- directed acyclic graph
- weighted graph
- graph matching
- similarity function
- graph laplacian
- kernel machines
- normalized cut
- feature extraction
- graph databases
- random walk
- betweenness centrality
- semi supervised
- feature space