Richardson's Theorem for k-colored kernels in strongly connected digraphs.
Hortensia Galeana-SánchezJuan José Montellano-BallesterosPublished in: Discret. Appl. Math. (2016)
Keyphrases
- strongly connected
- directed graph
- undirected graph
- optimum path forest
- random walk
- kernel function
- kernel methods
- support vector
- approximation algorithms
- von neumann
- graph structure
- directed acyclic graph
- gaussian processes
- interactive theorem proving
- linear combination
- nearest neighbor
- feature space
- reinforcement learning
- kernel learning
- string kernels
- upper bound
- special case
- digital topology