Turing kernelization for finding long paths and cycles in restricted graph classes.
Bart M. P. JansenPublished in: J. Comput. Syst. Sci. (2017)
Keyphrases
- equivalence classes
- graph theory
- structured data
- strongly connected
- path length
- directed graph
- path finding
- graph theoretic
- graph model
- graph mining
- shortest path
- random walk
- turing machine
- maximum clique
- graph search
- stable set
- graph partitioning
- edge weights
- machine intelligence
- graph representation
- learning algorithm
- weighted graph
- graph matching
- connected components
- least squares