Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs.
Mingyu XiaoHiroshi NagamochiPublished in: ISAAC (2014)
Keyphrases
- graph kernels
- representational power
- random graphs
- feature space
- polynomial time complexity
- special case
- bounded treewidth
- np complete
- kernel function
- graph matching
- bounded degree
- support vector
- graph theoretic
- graph model
- graph mining
- graph theory
- decision problems
- linear combination
- worst case
- computational cost
- lower bound
- computational complexity