A polynomial kernel for vertex deletion into bipartite permutation graphs.
Jan DerbiszPublished in: CoRR (2021)
Keyphrases
- undirected graph
- polynomial kernels
- vertex set
- bipartite graph
- directed graph
- graph model
- edge weights
- kernel function
- gaussian kernels
- support vector machine
- weighted graph
- spanning tree
- support vector
- directed acyclic graph
- graph structure
- learning algorithm
- real valued
- semi supervised
- linearly separable
- feature vectors
- finite sets
- feature selection