On the Hardness and Inapproximability of Recognizing Wheeler Graphs.
Daniel GibneySharma V. ThankachanPublished in: ESA (2019)
Keyphrases
- graph theoretic
- approximation algorithms
- graph theory
- graph matching
- information theoretic
- phase transition
- learning theory
- structured objects
- automatic recognition
- weighted graph
- database
- np complete
- worst case
- graph structure
- np hard
- graph mining
- graph model
- computational complexity
- bayesian networks
- random graphs
- graph kernels
- data mining