On the Hardness and Inapproximability of Recognizing Wheeler Graphs.
Daniel GibneySharma V. ThankachanPublished in: CoRR (2019)
Keyphrases
- graph theoretic
- approximation algorithms
- computational complexity
- graph representation
- graph model
- graph matching
- automatic recognition
- graph databases
- np hard
- information theoretic
- structured objects
- database
- weighted graph
- directed graph
- learning theory
- graph theory
- special case
- pairwise
- image segmentation
- undirected graph
- social networks
- search engine
- genetic algorithm
- random graphs
- data sets