Enumerating the Kernels of a Directed Graph with no Odd Circuits.
Jayme Luiz SzwarcfiterGuy ChatyPublished in: Inf. Process. Lett. (1994)
Keyphrases
- directed graph
- random walk
- maximum flow
- support vector
- kernel function
- analog circuits
- delay insensitive
- logic synthesis
- circuit design
- directed acyclic graph
- linear combination
- high speed
- feature space
- kernel methods
- web graph
- shortest path problem
- wireless networks
- graph structures
- strongly connected
- reinforcement learning
- disjoint paths
- logic circuits
- undirected graph