Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor.
Bart M. P. JansenMarcin PilipczukMarcin WrochnaPublished in: Algorithmica (2019)
Keyphrases
- connected components
- graph theory
- random walk
- equivalence classes
- maximum clique
- topological information
- structured data
- graph structure
- weighted graph
- graph matching
- graph theoretic
- topological properties
- graph representation
- graph model
- similarity measure
- data sets
- topological map
- disjoint paths
- dependency graph
- path length
- optimal path
- machine intelligence
- graph databases
- directed graph
- shortest path
- d objects
- social networks