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: CoRR (2015)
Keyphrases
- directed graph
- labeled graphs
- minimum weight
- graph kernels
- edge weights
- undirected graph
- graph representation
- random walk
- kernel function
- hamiltonian cycle
- graph structure
- average degree
- vertex set
- attributed graphs
- hilbert space
- path length
- graph model
- kernel methods
- maximum cardinality
- spanning tree
- strongly connected
- series parallel
- regularized least squares
- shortest path
- disjoint paths
- support vector
- linear model
- bipartite graph
- graph matching
- structured data
- social networks
- simple linear
- graph laplacian
- kernel learning
- graph data
- kernel matrix
- graph partitioning
- directed acyclic graph
- connected components
- semi supervised