Complexity and kernels for bipartition into degree-bounded induced graphs.

Mingyu Xiao Hiroshi Nagamochi

Published in: Theor. Comput. Sci. (2017)

Keyphrases

random graphs
bounded treewidth
graph kernels
worst case
linear combination
graph theory
gaussian processes
computational complexity
computational cost
social network analysis
graph matching
multiple kernel learning
kernel machines
polynomial time complexity