Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.
Bart M. P. JansenMarcin PilipczukMarcin WrochnaPublished in: CoRR (2017)
Keyphrases
- connected components
- equivalence classes
- graph representation
- structured data
- maximum clique
- directed graph
- path length
- weighted graph
- topological map
- graph model
- graph theory
- class labels
- shortest path
- bounded degree
- topological information
- data sets
- turing machine
- graph clustering
- graph theoretic
- graph partitioning
- spanning tree
- graph structure